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/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:32:29,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:32:29,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:32:29,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:32:29,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:32:29,588 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:32:29,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:32:29,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:32:29,593 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:32:29,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:32:29,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:32:29,595 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:32:29,596 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:32:29,597 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:32:29,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:32:29,599 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:32:29,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:32:29,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:32:29,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:32:29,605 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:32:29,606 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:32:29,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:32:29,610 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:32:29,610 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:32:29,611 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:32:29,612 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:32:29,613 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:32:29,613 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:32:29,614 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:32:29,615 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:32:29,616 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:32:29,617 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:32:29,617 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:32:29,617 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:32:29,618 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:32:29,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:32:29,619 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:32:29,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:32:29,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:32:29,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:32:29,647 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:32:29,647 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:32:29,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:32:29,648 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:32:29,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:32:29,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:32:29,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:32:29,650 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:32:29,650 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:32:29,650 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:32:29,650 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:32:29,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:32:29,651 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:32:29,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:32:29,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:32:29,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:32:29,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:32:29,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:32:29,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:32:29,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:32:29,654 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:32:29,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:32:29,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:32:29,655 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:32:29,655 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:32:29,655 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:32:29,655 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:32:29,727 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:32:29,745 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:32:29,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:32:29,753 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:32:29,753 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:32:29,754 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl [2018-10-04 12:32:29,755 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-sophisticated.bpl' [2018-10-04 12:32:29,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:32:29,808 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:32:29,809 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:32:29,809 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:32:29,810 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:32:29,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,852 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-04 12:32:29,852 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-04 12:32:29,853 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-04 12:32:29,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:32:29,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:32:29,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:32:29,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:32:29,868 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,882 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/1) ... [2018-10-04 12:32:29,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:32:29,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:32:29,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:32:29,885 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:32:29,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (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:32:29,962 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-10-04 12:32:29,962 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-04 12:32:29,962 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-04 12:32:30,190 INFO L338 CfgBuilder]: Using library mode [2018-10-04 12:32:30,191 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:32:30 BoogieIcfgContainer [2018-10-04 12:32:30,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:32:30,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:32:30,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:32:30,196 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:32:30,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:32:29" (1/2) ... [2018-10-04 12:32:30,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bce42d1 and model type Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:32:30, skipping insertion in model container [2018-10-04 12:32:30,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:32:30" (2/2) ... [2018-10-04 12:32:30,199 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-sophisticated.bpl [2018-10-04 12:32:30,209 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:32:30,217 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:32:30,271 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:32:30,272 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:32:30,273 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:32:30,273 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:32:30,273 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:32:30,273 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:32:30,273 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:32:30,274 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:32:30,274 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:32:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 12:32:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 12:32:30,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:30,308 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 12:32:30,310 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:30,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:30,319 INFO L82 PathProgramCache]: Analyzing trace with hash 30240, now seen corresponding path program 1 times [2018-10-04 12:32:30,321 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:30,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:30,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:30,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:30,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:30,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:30,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:32:30,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:32:30,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:32:30,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:32:30,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:32:30,477 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 12:32:30,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:30,546 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-10-04 12:32:30,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:32:30,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 12:32:30,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:30,572 INFO L225 Difference]: With dead ends: 15 [2018-10-04 12:32:30,575 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 12:32:30,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:32:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 12:32:30,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-10-04 12:32:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-04 12:32:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-10-04 12:32:30,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2018-10-04 12:32:30,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:30,652 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-10-04 12:32:30,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:32:30,652 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-10-04 12:32:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:32:30,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:30,653 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:32:30,653 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:30,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:30,654 INFO L82 PathProgramCache]: Analyzing trace with hash 28755491, now seen corresponding path program 1 times [2018-10-04 12:32:30,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:30,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:30,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:30,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:30,715 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:32:30,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:30,716 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:32:30,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:30,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:30,785 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:32:30,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:30,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:32:30,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:32:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:32:30,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:32:30,820 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-10-04 12:32:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:30,949 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2018-10-04 12:32:30,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:32:30,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 12:32:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:30,951 INFO L225 Difference]: With dead ends: 11 [2018-10-04 12:32:30,951 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:32:30,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:32:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:32:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-10-04 12:32:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:32:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 12:32:30,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 12:32:30,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:30,961 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 12:32:30,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:32:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 12:32:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:32:30,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:30,963 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:32:30,963 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:30,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:30,964 INFO L82 PathProgramCache]: Analyzing trace with hash 28757413, now seen corresponding path program 1 times [2018-10-04 12:32:30,964 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:30,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:30,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:31,045 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:32:31,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:31,046 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) [2018-10-04 12:32:31,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:31,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:31,084 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:32:31,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:31,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-04 12:32:31,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:32:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:32:31,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:32:31,106 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 4 states. [2018-10-04 12:32:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:31,154 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-10-04 12:32:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:32:31,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 12:32:31,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:31,155 INFO L225 Difference]: With dead ends: 12 [2018-10-04 12:32:31,155 INFO L226 Difference]: Without dead ends: 10 [2018-10-04 12:32:31,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:32:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-04 12:32:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2018-10-04 12:32:31,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:32:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-10-04 12:32:31,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2018-10-04 12:32:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:31,159 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-10-04 12:32:31,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:32:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-10-04 12:32:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:32:31,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:31,160 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 12:32:31,161 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:31,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:31,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1863917926, now seen corresponding path program 2 times [2018-10-04 12:32:31,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:31,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:31,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:31,240 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:32:31,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:31,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:31,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:31,264 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:31,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:31,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:31,271 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:32:31,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:31,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:32:31,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:32:31,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:32:31,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:31,294 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-10-04 12:32:31,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:31,362 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 12:32:31,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:32:31,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:32:31,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:31,363 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:32:31,364 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:32:31,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:31,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:32:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 12:32:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:32:31,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 12:32:31,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 12:32:31,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:31,369 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 12:32:31,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:32:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 12:32:31,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:32:31,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:31,369 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 12:32:31,370 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:31,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:31,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1863919848, now seen corresponding path program 1 times [2018-10-04 12:32:31,370 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:31,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:31,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:31,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:31,458 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:32:31,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:31,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:31,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:31,482 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:32:31,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:31,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:32:31,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:32:31,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:32:31,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:31,503 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 12:32:31,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:31,681 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2018-10-04 12:32:31,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:32:31,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:32:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:31,683 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:32:31,683 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:32:31,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:32:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2018-10-04 12:32:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:32:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 12:32:31,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 12:32:31,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:31,691 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 12:32:31,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:32:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 12:32:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:32:31,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:31,692 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 12:32:31,694 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:31,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:31,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1865764968, now seen corresponding path program 2 times [2018-10-04 12:32:31,694 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:31,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:31,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:31,833 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:32:31,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:31,834 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:32:31,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:31,857 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:31,857 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:31,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:31,866 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:32:31,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:31,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:32:31,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:32:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:32:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:31,888 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 5 states. [2018-10-04 12:32:31,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:31,957 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-10-04 12:32:31,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:32:31,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:32:31,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:31,960 INFO L225 Difference]: With dead ends: 17 [2018-10-04 12:32:31,960 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:32:31,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:31,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:32:31,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 12. [2018-10-04 12:32:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:32:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:32:31,966 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 7 [2018-10-04 12:32:31,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:31,966 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:32:31,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:32:31,966 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:32:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:32:31,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:31,967 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1] [2018-10-04 12:32:31,967 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:31,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1865766890, now seen corresponding path program 2 times [2018-10-04 12:32:31,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:31,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:32,016 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:32:32,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:32,016 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:32:32,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:32,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:32,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:32,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:32,040 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:32:32,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:32,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:32:32,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:32:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:32:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:32,066 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 5 states. [2018-10-04 12:32:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:32,096 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2018-10-04 12:32:32,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:32:32,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:32:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:32,098 INFO L225 Difference]: With dead ends: 16 [2018-10-04 12:32:32,099 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 12:32:32,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:32:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 12:32:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2018-10-04 12:32:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 12:32:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-10-04 12:32:32,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2018-10-04 12:32:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:32,105 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-10-04 12:32:32,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:32:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2018-10-04 12:32:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:32,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:32,106 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 12:32:32,107 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:32,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash 223459305, now seen corresponding path program 3 times [2018-10-04 12:32:32,107 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:32,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:32,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:32,249 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:32:32,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:32,250 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:32:32,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:32,268 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:32:32,268 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:32,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:32,274 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:32:32,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:32,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:32,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:32,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:32,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:32,296 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2018-10-04 12:32:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:32,363 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 12:32:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:32,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:32,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:32,364 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:32:32,364 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:32:32,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:32,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:32:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 12:32:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:32:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:32:32,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 12:32:32,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:32,371 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:32:32,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:32:32,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:32,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:32,372 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:32:32,373 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:32,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:32,373 INFO L82 PathProgramCache]: Analyzing trace with hash 223461227, now seen corresponding path program 3 times [2018-10-04 12:32:32,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:32,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:32,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:32,427 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:32:32,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:32,428 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:32:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:32,443 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:32:32,444 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:32,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:32,450 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:32:32,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:32,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:32,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:32,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:32,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:32,474 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 12:32:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:32,541 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 12:32:32,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:32,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:32,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:32,542 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:32:32,542 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:32:32,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:32:32,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 12:32:32,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:32:32,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:32:32,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 12:32:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:32,547 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:32:32,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:32:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:32,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:32,548 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:32:32,549 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:32,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:32,549 INFO L82 PathProgramCache]: Analyzing trace with hash 225306347, now seen corresponding path program 4 times [2018-10-04 12:32:32,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:32,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:32,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:32,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:32,598 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:32:32,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:32,599 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:32,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:32,616 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:32,616 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:32,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:32,622 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:32:32,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:32,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:32,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:32,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:32,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:32,643 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 12:32:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:32,680 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-10-04 12:32:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:32,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:32,681 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:32:32,682 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:32:32,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:32,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:32:32,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2018-10-04 12:32:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:32:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:32:32,687 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 12:32:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:32,687 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:32:32,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:32,688 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:32:32,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:32,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:32,688 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:32:32,689 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:32,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:32,689 INFO L82 PathProgramCache]: Analyzing trace with hash 225308269, now seen corresponding path program 5 times [2018-10-04 12:32:32,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:32,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:32,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:32,789 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:32:32,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:32,789 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:32,807 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:32,870 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-04 12:32:32,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:32,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:32,879 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:32:32,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:32,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:32,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:32,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:32,917 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 12:32:33,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:33,090 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-10-04 12:32:33,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:33,090 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:33,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:33,091 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:32:33,091 INFO L226 Difference]: Without dead ends: 16 [2018-10-04 12:32:33,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-04 12:32:33,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 12. [2018-10-04 12:32:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:32:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:32:33,096 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 12:32:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:33,097 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:32:33,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:32:33,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:33,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:33,098 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:32:33,098 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:33,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:33,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1998466667, now seen corresponding path program 6 times [2018-10-04 12:32:33,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:33,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:33,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:33,155 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:32:33,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:33,156 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:32:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:33,169 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-04 12:32:33,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:33,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:33,175 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:32:33,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:33,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:33,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:33,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:33,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,200 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 6 states. [2018-10-04 12:32:33,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:33,227 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:32:33,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:33,228 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:33,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:33,228 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:32:33,228 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:32:33,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:32:33,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2018-10-04 12:32:33,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:33,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:33,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 12:32:33,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:33,236 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:33,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:33,236 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:33,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:33,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:33,237 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:32:33,237 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:33,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:33,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1998468589, now seen corresponding path program 7 times [2018-10-04 12:32:33,238 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:33,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:33,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:33,294 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:32:33,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:33,294 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:32:33,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:33,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:33,312 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:32:33,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:33,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:33,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:33,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,334 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 12:32:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:33,368 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:32:33,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:33,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:33,369 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:32:33,369 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:32:33,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:32:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 14. [2018-10-04 12:32:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:32:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:32:33,375 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 9 [2018-10-04 12:32:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:33,375 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:32:33,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:32:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:33,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:33,376 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 12:32:33,376 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:33,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 2000313709, now seen corresponding path program 8 times [2018-10-04 12:32:33,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:33,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:33,439 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:32:33,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:33,440 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:32:33,448 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:33,454 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:33,455 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:33,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:33,462 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:32:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:33,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:33,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:33,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:33,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,485 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 6 states. [2018-10-04 12:32:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:33,541 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2018-10-04 12:32:33,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:33,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:33,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:33,546 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:32:33,546 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 12:32:33,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 12:32:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-04 12:32:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:33,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 9 [2018-10-04 12:32:33,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:33,553 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:33,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:33,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:32:33,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:33,554 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1] [2018-10-04 12:32:33,555 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:33,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:33,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2000315631, now seen corresponding path program 3 times [2018-10-04 12:32:33,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:33,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:33,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:33,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:33,769 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:32:33,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:33,770 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:32:33,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:33,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:32:33,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:33,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:33,792 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:32:33,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:33,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:32:33,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:32:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:32:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,813 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 6 states. [2018-10-04 12:32:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:33,869 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2018-10-04 12:32:33,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:32:33,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-10-04 12:32:33,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:33,871 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:32:33,871 INFO L226 Difference]: Without dead ends: 18 [2018-10-04 12:32:33,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-04 12:32:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-04 12:32:33,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 12. [2018-10-04 12:32:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:32:33,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2018-10-04 12:32:33,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2018-10-04 12:32:33,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:33,877 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-10-04 12:32:33,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:32:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2018-10-04 12:32:33,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:33,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:33,878 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 12:32:33,878 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:33,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:33,879 INFO L82 PathProgramCache]: Analyzing trace with hash -4277844, now seen corresponding path program 4 times [2018-10-04 12:32:33,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:33,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:33,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:33,983 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:32:33,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:33,984 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:32:33,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:34,028 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:34,029 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:34,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:34,034 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:32:34,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:34,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:34,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:34,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:34,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,065 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2018-10-04 12:32:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:34,130 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:32:34,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:34,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:34,132 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:32:34,132 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:32:34,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:32:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 12:32:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:34,141 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:32:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:34,141 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:34,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:34,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:34,142 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:34,142 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:34,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash -4275922, now seen corresponding path program 9 times [2018-10-04 12:32:34,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:34,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:34,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:34,206 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:32:34,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:34,207 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:32:34,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:34,222 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 12:32:34,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:34,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:34,228 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:32:34,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:34,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:34,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:34,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:34,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,249 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:32:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:34,281 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:32:34,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:34,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:34,282 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:32:34,283 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:32:34,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:32:34,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 12:32:34,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:34,290 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 12:32:34,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:34,290 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:34,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:34,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:34,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:34,291 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:34,291 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:34,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2430802, now seen corresponding path program 10 times [2018-10-04 12:32:34,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:34,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:34,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:34,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:34,388 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:32:34,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:34,389 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:32:34,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:34,417 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:34,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:34,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:34,421 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:32:34,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:34,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:34,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:34,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,443 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 12:32:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:34,513 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:32:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:34,513 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:34,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:34,514 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:32:34,514 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:32:34,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:32:34,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 12:32:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:34,524 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:32:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:34,524 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:34,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:34,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:34,525 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:32:34,525 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:34,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2428880, now seen corresponding path program 11 times [2018-10-04 12:32:34,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:34,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:34,714 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:32:34,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:34,714 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:32:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:34,740 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 12:32:34,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:34,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:34,747 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:32:34,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:34,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:34,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:34,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,770 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:32:34,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:34,948 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 12:32:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:34,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:34,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:34,949 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:32:34,949 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:32:34,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:32:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 12:32:34,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:32:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:32:34,958 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 12:32:34,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:34,958 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:32:34,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:34,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:32:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:34,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:34,961 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:34,961 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:34,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1770729518, now seen corresponding path program 12 times [2018-10-04 12:32:34,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:34,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:35,157 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:32:35,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:35,157 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:32:35,166 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:35,176 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 12:32:35,176 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:35,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:35,182 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:32:35,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:35,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:35,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:35,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:35,204 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 12:32:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:35,288 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:32:35,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:35,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:35,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:35,288 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:32:35,289 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:32:35,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:35,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:32:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2018-10-04 12:32:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:35,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:32:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:35,297 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:35,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:35,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:35,297 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:32:35,298 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:35,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:35,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1770731440, now seen corresponding path program 13 times [2018-10-04 12:32:35,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:35,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:35,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:35,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:35,366 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:32:35,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:35,366 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:35,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:35,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:35,401 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:32:35,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:35,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:35,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:35,429 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:32:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:35,578 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:32:35,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:35,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:35,578 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:32:35,578 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:32:35,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:35,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:32:35,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2018-10-04 12:32:35,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:35,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:35,586 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 12:32:35,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:35,586 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:35,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:35,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:35,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:35,587 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:32:35,587 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:35,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:35,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1772576560, now seen corresponding path program 14 times [2018-10-04 12:32:35,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:35,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:35,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:35,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:35,651 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:32:35,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:35,652 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:35,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:35,694 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:35,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:35,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:35,700 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:32:35,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:35,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:35,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:35,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:35,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:35,722 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 12:32:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:35,763 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2018-10-04 12:32:35,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:35,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:35,765 INFO L225 Difference]: With dead ends: 23 [2018-10-04 12:32:35,765 INFO L226 Difference]: Without dead ends: 21 [2018-10-04 12:32:35,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-04 12:32:35,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2018-10-04 12:32:35,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:35,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:35,774 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:32:35,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:35,774 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:35,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:35,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:35,775 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:35,775 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:35,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1772578482, now seen corresponding path program 15 times [2018-10-04 12:32:35,775 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:35,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:35,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:35,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:35,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:35,831 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:32:35,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:35,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 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:32:35,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:35,853 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 12:32:35,854 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:35,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:35,858 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:32:35,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:35,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:35,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:35,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:35,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:35,880 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:32:36,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:36,076 INFO L93 Difference]: Finished difference Result 22 states and 30 transitions. [2018-10-04 12:32:36,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:36,077 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:36,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:36,077 INFO L225 Difference]: With dead ends: 22 [2018-10-04 12:32:36,077 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:32:36,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:36,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:32:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 14. [2018-10-04 12:32:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:32:36,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:32:36,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 12:32:36,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:36,092 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:32:36,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:36,093 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:32:36,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:36,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:36,093 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:36,094 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:36,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:36,094 INFO L82 PathProgramCache]: Analyzing trace with hash 675780526, now seen corresponding path program 16 times [2018-10-04 12:32:36,094 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:36,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:36,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:36,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:36,534 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:32:36,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:36,535 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:32:36,544 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:36,551 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:36,551 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:36,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:36,555 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:32:36,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:36,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:36,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:36,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:36,575 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2018-10-04 12:32:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:36,629 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:36,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:36,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:36,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:36,630 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:36,630 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:36,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:36,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:32:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:36,639 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:32:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:36,639 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:36,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:36,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:36,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:36,640 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:32:36,640 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:36,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash 675782448, now seen corresponding path program 17 times [2018-10-04 12:32:36,641 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:36,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:36,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:36,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:36,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:36,691 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:32:36,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:36,691 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:32:36,702 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:36,713 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-10-04 12:32:36,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:36,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:36,722 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:32:36,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:36,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:36,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:36,756 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:32:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:37,025 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:32:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:37,026 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:37,026 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:32:37,027 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:32:37,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:32:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2018-10-04 12:32:37,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:37,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:37,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:32:37,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:37,040 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:37,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:37,041 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:37,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:37,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:37,041 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:32:37,042 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:37,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:37,042 INFO L82 PathProgramCache]: Analyzing trace with hash 677627568, now seen corresponding path program 18 times [2018-10-04 12:32:37,042 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:37,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:37,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:37,288 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:32:37,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:37,288 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:32:37,296 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:37,308 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-10-04 12:32:37,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:37,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:37,312 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:32:37,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:37,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:37,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:37,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:37,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,340 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:32:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:37,449 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:37,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:37,449 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:37,450 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:37,450 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:37,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:32:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:37,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:37,462 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:32:37,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:37,463 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:37,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:37,463 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:37,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:37,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:37,464 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:37,464 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:37,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:37,464 INFO L82 PathProgramCache]: Analyzing trace with hash 677629490, now seen corresponding path program 19 times [2018-10-04 12:32:37,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:37,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:37,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:37,557 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:32:37,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:37,557 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:32:37,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:37,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:37,572 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:32:37,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:37,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:37,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:37,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:37,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,593 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:32:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:37,675 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:32:37,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:37,675 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:37,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:37,676 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:32:37,676 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:32:37,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:32:37,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2018-10-04 12:32:37,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:37,683 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 11 [2018-10-04 12:32:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:37,683 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:37,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:37,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:37,684 INFO L375 BasicCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1] [2018-10-04 12:32:37,684 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:37,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1844179408, now seen corresponding path program 20 times [2018-10-04 12:32:37,685 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:37,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:37,759 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:32:37,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:37,759 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:32:37,768 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:37,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:37,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:37,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:37,778 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:32:37,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:37,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:37,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:37,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,806 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 7 states. [2018-10-04 12:32:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:37,851 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:32:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:37,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:37,852 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:32:37,852 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:32:37,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:32:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-10-04 12:32:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:37,863 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:32:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:37,863 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:37,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:37,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:37,864 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:37,865 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:37,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1844177486, now seen corresponding path program 21 times [2018-10-04 12:32:37,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:37,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:37,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:37,914 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:32:37,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:37,914 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:32:37,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:37,929 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-04 12:32:37,930 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:37,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:37,935 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:32:37,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:37,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:37,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:37,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:37,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:37,956 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:32:38,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:38,069 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:32:38,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:38,070 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:38,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:38,070 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:32:38,070 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:32:38,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:38,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:32:38,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-10-04 12:32:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:38,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:38,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 11 [2018-10-04 12:32:38,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:38,080 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:38,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:38,080 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:38,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:38,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:38,081 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 12:32:38,081 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:38,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1842332366, now seen corresponding path program 22 times [2018-10-04 12:32:38,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:38,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:38,141 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:32:38,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:38,142 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:32:38,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:38,158 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:38,158 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:38,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:38,162 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:32:38,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:38,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:38,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:38,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:38,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:38,185 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 7 states. [2018-10-04 12:32:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:38,243 INFO L93 Difference]: Finished difference Result 25 states and 34 transitions. [2018-10-04 12:32:38,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:38,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:38,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:38,244 INFO L225 Difference]: With dead ends: 25 [2018-10-04 12:32:38,244 INFO L226 Difference]: Without dead ends: 23 [2018-10-04 12:32:38,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-04 12:32:38,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-04 12:32:38,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:38,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:38,252 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 11 [2018-10-04 12:32:38,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:38,253 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:38,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:38,253 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:38,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:32:38,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:38,254 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1] [2018-10-04 12:32:38,254 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:38,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:38,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1842330444, now seen corresponding path program 4 times [2018-10-04 12:32:38,254 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:38,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:38,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:38,318 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:32:38,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:38,319 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:32:38,327 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:38,353 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:38,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:38,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:38,357 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:32:38,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:38,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-04 12:32:38,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-04 12:32:38,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-04 12:32:38,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:38,387 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 7 states. [2018-10-04 12:32:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:38,463 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2018-10-04 12:32:38,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:32:38,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-10-04 12:32:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:38,463 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:32:38,463 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 12:32:38,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-04 12:32:38,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 12:32:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 14. [2018-10-04 12:32:38,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:32:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-10-04 12:32:38,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2018-10-04 12:32:38,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:38,470 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-10-04 12:32:38,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-04 12:32:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2018-10-04 12:32:38,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:38,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:38,471 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 12:32:38,471 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:38,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash 183654063, now seen corresponding path program 5 times [2018-10-04 12:32:38,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:38,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:38,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:38,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 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:32:38,544 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:38,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:32:38,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:38,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:38,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:38,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:38,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:38,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:38,658 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2018-10-04 12:32:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:38,839 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:38,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:38,840 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:38,840 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:38,840 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:38,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:32:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:38,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:38,854 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:38,855 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:38,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:38,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:38,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:38,855 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:38,855 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:38,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:38,856 INFO L82 PathProgramCache]: Analyzing trace with hash 183655985, now seen corresponding path program 23 times [2018-10-04 12:32:38,856 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:38,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:38,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:38,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:38,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:38,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:38,901 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:32:38,909 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:38,915 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:32:38,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:38,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:38,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:38,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:38,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:38,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:38,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:38,942 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:38,990 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:38,991 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:38,991 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:38,991 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:38,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:32:39,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:39,002 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:32:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:39,002 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:39,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:39,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:39,003 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:39,003 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:39,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash 185501105, now seen corresponding path program 24 times [2018-10-04 12:32:39,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:39,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:39,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:39,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:39,071 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:39,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 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:32:39,079 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:39,088 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:32:39,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:39,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:39,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:39,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,117 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:32:39,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:39,171 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:39,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:39,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:39,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:39,172 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:39,172 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:39,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:32:39,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:39,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:39,184 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:39,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:39,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:39,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:39,185 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:39,185 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:39,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:39,185 INFO L82 PathProgramCache]: Analyzing trace with hash 185503027, now seen corresponding path program 25 times [2018-10-04 12:32:39,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:39,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:39,235 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:32:39,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:39,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:39,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:39,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:39,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:39,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,304 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:39,349 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:39,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:39,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:39,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:39,350 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:39,350 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:39,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 12:32:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:39,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:39,362 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 12:32:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:39,363 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:39,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:39,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:39,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:39,363 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:39,363 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:39,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1958661425, now seen corresponding path program 26 times [2018-10-04 12:32:39,364 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:39,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:39,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:39,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:39,526 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:32:39,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:39,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:39,538 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:39,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:39,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:39,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:39,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:39,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,568 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 12:32:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:39,622 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:32:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:39,623 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:39,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:39,623 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:32:39,623 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:32:39,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:32:39,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 12:32:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:39,635 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:39,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:39,635 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:39,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:39,635 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:39,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:39,636 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:39,636 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:39,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1958663347, now seen corresponding path program 27 times [2018-10-04 12:32:39,636 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:39,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:39,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:39,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:39,687 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:32:39,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:39,701 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:32:39,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:39,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:39,706 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:39,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:39,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:39,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:39,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,726 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:39,763 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:32:39,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:39,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:39,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:39,764 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:32:39,764 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:32:39,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:32:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 12:32:39,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:39,780 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:32:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:39,780 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:39,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:39,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:39,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:39,781 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:39,781 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:39,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1960508467, now seen corresponding path program 28 times [2018-10-04 12:32:39,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:39,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:39,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:39,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:39,856 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:32:39,865 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:39,870 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:39,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:39,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:39,878 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:39,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:39,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:39,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:39,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:39,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,899 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:32:39,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:39,947 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:32:39,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:39,947 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:39,948 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:32:39,948 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:32:39,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:32:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 12:32:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:39,961 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:39,962 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:39,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:39,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:39,962 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:39,963 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:39,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:39,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1960510389, now seen corresponding path program 29 times [2018-10-04 12:32:39,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:39,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:39,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:39,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:40,030 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:32:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:40,051 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:32:40,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:40,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:40,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:40,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,083 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:40,131 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 12:32:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:40,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:40,132 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:32:40,132 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:32:40,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:32:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 12:32:40,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:40,144 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 12:32:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:40,145 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:40,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:40,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:40,145 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:40,146 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:40,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash 863712433, now seen corresponding path program 30 times [2018-10-04 12:32:40,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:40,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:40,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:40,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:40,306 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:40,314 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:40,324 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:32:40,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:40,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:40,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:40,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:40,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:40,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,350 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 12:32:40,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:40,395 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:40,395 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:40,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:40,396 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:40,396 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:40,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:40,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:32:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:40,412 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:40,413 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:40,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:40,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:40,413 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:40,413 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:40,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash 863714355, now seen corresponding path program 31 times [2018-10-04 12:32:40,414 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:40,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,573 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:40,573 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:32:40,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:40,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:40,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:40,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,617 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:40,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:40,662 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:40,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:40,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:40,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:40,663 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:40,664 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:40,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:40,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2018-10-04 12:32:40,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:40,679 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:32:40,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:40,679 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:40,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:40,679 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:40,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:40,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:40,680 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:40,680 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:40,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 865559475, now seen corresponding path program 32 times [2018-10-04 12:32:40,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:40,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:40,762 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:32:40,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:40,776 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:40,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:40,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:40,781 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:40,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:40,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:40,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,802 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:32:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:40,855 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:40,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:40,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:40,856 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:40,856 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:40,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:40,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:32:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:40,871 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:40,871 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:40,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:40,871 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:40,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:40,872 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:40,872 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:40,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:40,872 INFO L82 PathProgramCache]: Analyzing trace with hash 865561397, now seen corresponding path program 33 times [2018-10-04 12:32:40,872 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:40,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:40,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:40,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:40,920 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:32:40,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:40,935 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:32:40,935 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:40,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:40,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:40,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:40,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:40,960 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:41,056 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:41,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:41,057 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:41,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:41,057 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:41,057 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:41,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2018-10-04 12:32:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:41,069 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 12:32:41,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:41,070 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:41,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:41,070 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:41,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:41,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:41,070 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:41,070 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:41,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:41,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1656247501, now seen corresponding path program 34 times [2018-10-04 12:32:41,071 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:41,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:41,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:41,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:41,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:41,194 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:41,209 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:41,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:41,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:41,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:41,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:41,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:41,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,233 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 12:32:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:41,414 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:32:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:41,414 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:41,415 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:32:41,415 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:32:41,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:32:41,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2018-10-04 12:32:41,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:41,429 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:41,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:41,429 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:41,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:41,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:41,430 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:41,430 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:41,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:41,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1656245579, now seen corresponding path program 35 times [2018-10-04 12:32:41,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:41,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:41,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:41,489 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:41,490 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:32:41,497 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:41,504 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:32:41,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:41,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:41,508 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:41,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:41,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:41,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:41,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,529 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:41,561 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:32:41,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:41,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:41,562 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:32:41,562 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:32:41,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:32:41,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-10-04 12:32:41,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:41,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:41,576 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:32:41,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:41,577 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:41,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:41,577 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:41,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:41,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:41,577 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:41,577 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:41,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:41,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1654400459, now seen corresponding path program 36 times [2018-10-04 12:32:41,578 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:41,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:41,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:41,628 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:32:41,637 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:41,645 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:32:41,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:41,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:41,649 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:41,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:41,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,674 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:32:41,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:41,746 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2018-10-04 12:32:41,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:41,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:41,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:41,747 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:32:41,747 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:32:41,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:32:41,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 12:32:41,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:41,763 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:41,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:41,763 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:41,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:41,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:41,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:41,763 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:41,763 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:41,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:41,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1654398537, now seen corresponding path program 37 times [2018-10-04 12:32:41,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:41,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:41,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:41,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:41,809 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:32:41,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:41,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:41,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:41,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:41,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:41,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,850 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:41,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:41,913 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2018-10-04 12:32:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:41,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:41,914 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:32:41,914 INFO L226 Difference]: Without dead ends: 24 [2018-10-04 12:32:41,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:41,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-04 12:32:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2018-10-04 12:32:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:41,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 12:32:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:41,925 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:41,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:41,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:41,925 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:41,926 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:41,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 884718641, now seen corresponding path program 38 times [2018-10-04 12:32:41,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:41,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:41,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:41,973 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:32:41,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:41,984 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:41,984 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:41,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:42,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:42,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:42,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:42,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:42,008 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 8 states. [2018-10-04 12:32:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:42,104 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:42,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:42,105 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:42,105 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:42,105 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:42,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:42,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 12:32:42,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:42,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:42,125 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:42,126 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:42,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:42,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:42,126 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:42,126 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:42,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 884720563, now seen corresponding path program 39 times [2018-10-04 12:32:42,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:42,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:42,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:42,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:42,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:42,636 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:42,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:42,636 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:42,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:42,654 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:32:42,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:42,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:42,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:42,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:42,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:42,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:42,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:42,678 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:42,850 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:42,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:42,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:42,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:42,851 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:42,851 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:42,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:42,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:42,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 12:32:42,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:42,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:42,869 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:42,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:42,870 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:42,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:42,870 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:42,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:42,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:42,870 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:42,870 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:42,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:42,871 INFO L82 PathProgramCache]: Analyzing trace with hash 886565683, now seen corresponding path program 40 times [2018-10-04 12:32:42,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:42,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:42,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:42,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:42,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:42,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:42,938 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:32:42,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:42,954 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:42,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:42,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:42,957 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:42,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:42,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:42,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:42,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:42,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:42,977 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:43,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:43,032 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:43,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:43,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:43,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:43,033 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:43,033 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:43,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:43,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 12:32:43,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:43,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:43,054 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:43,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:43,055 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:43,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:43,055 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:43,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:43,055 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:43,056 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:43,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:43,056 INFO L82 PathProgramCache]: Analyzing trace with hash 886567605, now seen corresponding path program 41 times [2018-10-04 12:32:43,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:43,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:43,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:43,198 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:43,207 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:43,214 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:32:43,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:43,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:43,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:43,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:43,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,238 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:43,290 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:43,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:43,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:43,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:43,290 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:43,291 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:43,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 20. [2018-10-04 12:32:43,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:43,308 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:32:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:43,308 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:43,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:43,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:43,309 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:43,309 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:43,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:43,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1635241293, now seen corresponding path program 42 times [2018-10-04 12:32:43,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:43,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:43,357 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:32:43,365 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:43,370 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:32:43,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:43,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:43,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:43,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,395 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:32:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:43,547 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:43,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:43,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:43,548 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:43,548 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:43,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 12:32:43,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:43,571 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:43,572 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:43,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:43,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:43,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:43,572 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:43,572 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:43,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1635239371, now seen corresponding path program 43 times [2018-10-04 12:32:43,573 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:43,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:43,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:43,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:43,627 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:43,627 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:32:43,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:43,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:43,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:43,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:43,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:43,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:43,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,666 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:43,738 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:43,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:43,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:43,739 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:43,739 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:43,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 12:32:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:43,758 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:43,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:43,758 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:43,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:43,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:43,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:43,759 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:43,759 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:43,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1633394251, now seen corresponding path program 44 times [2018-10-04 12:32:43,759 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:43,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:43,822 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:32:43,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:43,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:43,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:43,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:43,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:43,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:43,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:43,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:43,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,859 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:43,951 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:43,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:43,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:43,952 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:43,952 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:43,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:43,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 12:32:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:43,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:43,972 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:43,972 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:43,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:43,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:43,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:43,973 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:43,973 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:43,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:43,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1633392329, now seen corresponding path program 45 times [2018-10-04 12:32:43,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:43,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:43,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:43,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:44,028 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:44,028 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:32:44,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:44,049 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:32:44,049 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:44,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:44,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:44,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:44,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:44,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,072 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:44,134 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:44,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:44,135 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:44,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:44,136 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:44,136 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:44,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:44,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 18. [2018-10-04 12:32:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:44,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:44,153 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 13 [2018-10-04 12:32:44,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:44,153 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:44,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:44,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:44,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:44,154 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:44,154 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:44,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1564777011, now seen corresponding path program 46 times [2018-10-04 12:32:44,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:44,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:44,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:44,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:44,222 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:44,223 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:44,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:44,235 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:44,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:44,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:44,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:44,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:44,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:44,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:44,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,259 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 8 states. [2018-10-04 12:32:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:44,314 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:44,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:44,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:44,314 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:44,314 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:44,315 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:32:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:44,340 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:44,340 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:44,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:44,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:44,341 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:44,341 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:44,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:44,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1564778933, now seen corresponding path program 47 times [2018-10-04 12:32:44,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:44,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:44,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:44,396 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:32:44,404 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:44,411 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:32:44,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:44,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:44,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:44,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:44,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:44,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,434 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:44,500 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:44,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:44,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:44,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:44,501 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:44,501 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:44,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:44,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2018-10-04 12:32:44,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:44,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:44,529 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:44,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:44,529 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:44,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:44,529 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:44,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:44,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:44,530 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:44,530 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:44,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:44,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1566624053, now seen corresponding path program 48 times [2018-10-04 12:32:44,531 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:44,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:44,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:44,590 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:32:44,604 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:44,610 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-10-04 12:32:44,610 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:44,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:44,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:44,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:44,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,634 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:44,703 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:44,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:44,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:44,704 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:44,704 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:44,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:44,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:32:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:44,728 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:44,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:44,728 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:44,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:44,728 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:44,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:44,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:44,729 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:44,729 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:44,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:44,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1566625975, now seen corresponding path program 49 times [2018-10-04 12:32:44,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:44,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:44,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:44,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:44,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:44,790 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:32:44,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:44,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:44,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:44,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:44,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:44,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:44,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,838 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:44,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:44,956 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:44,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:44,957 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:44,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:44,957 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:44,957 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:44,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:44,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 20. [2018-10-04 12:32:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:44,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:44,979 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 13 [2018-10-04 12:32:44,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:44,979 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:44,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:44,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:44,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:44,980 INFO L375 BasicCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1] [2018-10-04 12:32:44,980 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:44,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:44,981 INFO L82 PathProgramCache]: Analyzing trace with hash -955182923, now seen corresponding path program 50 times [2018-10-04 12:32:44,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:44,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:44,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:44,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:44,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:45,030 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:32:45,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:45,044 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:45,045 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:45,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:45,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:45,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:45,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:45,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,074 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 8 states. [2018-10-04 12:32:45,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:45,145 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:45,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:45,145 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:45,145 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:45,145 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:45,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-10-04 12:32:45,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:45,173 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:45,173 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:45,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:45,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:45,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:45,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:45,174 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:45,174 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:45,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:45,174 INFO L82 PathProgramCache]: Analyzing trace with hash -955181001, now seen corresponding path program 51 times [2018-10-04 12:32:45,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:45,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:45,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:45,232 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:45,232 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:32:45,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:45,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:32:45,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:45,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:45,253 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:45,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:45,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:45,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:45,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,273 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:45,348 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:45,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:45,349 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:45,349 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:45,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:45,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2018-10-04 12:32:45,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:45,374 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 13 [2018-10-04 12:32:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:45,374 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:45,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:45,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:45,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:45,374 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 12:32:45,375 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:45,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:45,375 INFO L82 PathProgramCache]: Analyzing trace with hash -953335881, now seen corresponding path program 52 times [2018-10-04 12:32:45,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:45,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:45,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:45,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:45,466 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:32:45,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:45,482 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:45,482 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:45,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:45,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:45,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:45,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,506 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 8 states. [2018-10-04 12:32:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:45,560 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2018-10-04 12:32:45,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:45,560 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:45,561 INFO L225 Difference]: With dead ends: 29 [2018-10-04 12:32:45,561 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:32:45,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:32:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-10-04 12:32:45,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:45,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:45,585 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 13 [2018-10-04 12:32:45,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:45,585 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:45,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:32:45,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:45,585 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1] [2018-10-04 12:32:45,585 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:45,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash -953333959, now seen corresponding path program 5 times [2018-10-04 12:32:45,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:45,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:45,643 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:45,644 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:32:45,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:45,660 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:32:45,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:45,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:45,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:32:45,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:32:45,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:32:45,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,684 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 8 states. [2018-10-04 12:32:45,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:45,741 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2018-10-04 12:32:45,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:32:45,741 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-10-04 12:32:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:45,742 INFO L225 Difference]: With dead ends: 28 [2018-10-04 12:32:45,742 INFO L226 Difference]: Without dead ends: 26 [2018-10-04 12:32:45,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:32:45,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-04 12:32:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 16. [2018-10-04 12:32:45,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-04 12:32:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-10-04 12:32:45,760 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2018-10-04 12:32:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:45,760 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2018-10-04 12:32:45,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:32:45,760 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2018-10-04 12:32:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:45,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:45,760 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 12:32:45,760 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:45,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash 397590258, now seen corresponding path program 6 times [2018-10-04 12:32:45,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:45,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:45,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:45,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:45,819 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:32:45,828 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:45,837 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:45,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:45,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:45,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:45,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:45,867 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2018-10-04 12:32:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:45,963 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:45,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:45,964 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:45,964 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:45,964 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:45,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:32:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:45,994 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:45,994 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:45,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:45,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:45,995 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:32:45,995 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:45,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:45,995 INFO L82 PathProgramCache]: Analyzing trace with hash 397592180, now seen corresponding path program 53 times [2018-10-04 12:32:45,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:45,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:46,069 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:32:46,076 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:46,084 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:32:46,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:46,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:46,088 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:46,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:46,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:46,109 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:46,193 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:46,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:46,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:46,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:46,194 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:46,194 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:46,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:46,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:32:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:46,224 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:46,224 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:46,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:46,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:46,225 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:32:46,225 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:46,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash 399437300, now seen corresponding path program 54 times [2018-10-04 12:32:46,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:46,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:46,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:46,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:46,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:46,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:46,293 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:32:46,299 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:46,312 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:46,312 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:46,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:46,315 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:46,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:46,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:46,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:46,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:46,335 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:46,463 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:46,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:46,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:46,464 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:46,464 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:46,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:46,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:32:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:46,496 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:46,496 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:46,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:46,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:46,497 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:46,497 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:46,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:46,497 INFO L82 PathProgramCache]: Analyzing trace with hash 399439222, now seen corresponding path program 55 times [2018-10-04 12:32:46,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:46,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:46,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:46,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:46,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:46,669 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:46,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:46,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:46,693 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:46,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:46,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:46,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:46,714 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:46,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:46,830 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:46,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:46,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:46,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:46,831 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:46,831 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:46,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:46,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:46,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 12:32:46,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:46,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:46,862 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:32:46,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:46,862 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:46,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:46,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:46,863 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:32:46,863 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:46,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:46,863 INFO L82 PathProgramCache]: Analyzing trace with hash -2122369676, now seen corresponding path program 56 times [2018-10-04 12:32:46,863 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:46,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:46,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:46,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:46,943 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:46,943 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:46,950 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:46,955 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:46,955 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:46,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:46,959 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:46,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:46,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:46,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:46,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:46,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:46,979 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:32:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:47,078 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:47,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:47,078 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:47,078 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:47,078 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:47,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:47,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:47,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:32:47,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:47,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:47,112 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:47,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:47,112 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:47,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:47,113 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:47,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:47,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:47,113 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:47,113 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:47,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:47,113 INFO L82 PathProgramCache]: Analyzing trace with hash -2122367754, now seen corresponding path program 57 times [2018-10-04 12:32:47,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:47,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:47,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:47,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:47,168 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:47,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:47,168 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:47,176 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:47,184 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:32:47,184 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:47,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:47,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:47,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:47,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:47,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:47,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:47,218 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:47,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:47,322 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:47,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:47,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:47,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:47,323 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:47,323 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:47,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:32:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:47,357 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:47,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:47,357 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:47,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:47,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:47,358 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:47,358 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:47,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2120522634, now seen corresponding path program 58 times [2018-10-04 12:32:47,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:47,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:47,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:47,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:47,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:47,410 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:47,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:47,447 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:47,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:47,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:47,453 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:47,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:47,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:47,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:47,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:47,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:47,482 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:47,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:47,591 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:47,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:47,591 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:47,592 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:47,592 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:47,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:47,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:32:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:47,624 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:47,624 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:47,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:47,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:47,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:47,625 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:47,625 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:47,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:47,625 INFO L82 PathProgramCache]: Analyzing trace with hash -2120520712, now seen corresponding path program 59 times [2018-10-04 12:32:47,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:47,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:47,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:47,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:48,102 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:48,110 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:48,125 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:32:48,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:48,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:48,129 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:48,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:48,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:48,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:48,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,149 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:48,228 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:48,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:48,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:48,229 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:48,229 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:48,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 12:32:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:48,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 12:32:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:48,257 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:48,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:48,257 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:48,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:48,257 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:32:48,257 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:48,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1077648628, now seen corresponding path program 60 times [2018-10-04 12:32:48,258 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:48,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:48,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:48,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:48,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:48,364 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:48,372 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:48,373 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:48,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:48,376 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:48,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:48,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:48,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,401 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 12:32:48,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:48,485 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:48,485 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:48,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:48,486 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:48,486 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:48,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:48,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:32:48,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:48,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:48,526 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:48,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:48,527 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:48,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:48,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:48,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:48,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:48,527 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:48,527 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:48,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:48,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1077650550, now seen corresponding path program 61 times [2018-10-04 12:32:48,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:48,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:48,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:48,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:48,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:48,598 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:48,598 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:48,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:48,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:48,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:48,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:48,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,645 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:48,739 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:48,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:48,740 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:48,740 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:48,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:48,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:32:48,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:48,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:48,773 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:48,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:48,773 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:48,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:48,773 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:48,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:48,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:48,774 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:48,774 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:48,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:48,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1079495670, now seen corresponding path program 62 times [2018-10-04 12:32:48,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:48,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:48,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:48,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:48,833 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:48,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:48,845 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:48,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:48,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:48,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:48,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:48,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:48,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:48,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,870 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:48,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:48,977 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:48,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:48,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:48,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:48,977 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:48,978 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:48,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:32:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:49,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:49,016 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:49,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:49,016 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:49,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:49,017 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:49,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:49,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:49,017 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:49,017 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:49,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:49,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1079497592, now seen corresponding path program 63 times [2018-10-04 12:32:49,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:49,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:49,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:49,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:49,078 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:49,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:49,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:32:49,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:49,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:49,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:49,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:49,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:49,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:49,117 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:49,215 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:49,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:49,216 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:49,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:49,216 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:49,216 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:49,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 12:32:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:49,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:49,253 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:32:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:49,253 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:49,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:49,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:49,254 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:49,254 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:49,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:49,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1442311306, now seen corresponding path program 64 times [2018-10-04 12:32:49,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:49,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:49,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:49,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:49,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:49,312 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:49,322 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:49,328 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:49,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:49,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:49,331 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:49,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:49,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:49,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:49,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:49,351 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:32:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:49,454 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:49,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:49,454 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:49,455 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:49,455 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:49,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 12:32:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:49,492 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:49,492 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:49,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:49,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:49,492 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:49,493 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:49,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1442309384, now seen corresponding path program 65 times [2018-10-04 12:32:49,493 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:49,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:49,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:49,555 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:49,564 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:49,570 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:32:49,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:49,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:49,574 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:49,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:49,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:49,595 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:49,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:49,670 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:49,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:49,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:49,671 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:49,671 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:49,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:49,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 12:32:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:49,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:49,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:49,703 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:49,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:49,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:49,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:49,704 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:49,704 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:49,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:49,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1440464264, now seen corresponding path program 66 times [2018-10-04 12:32:49,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:49,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:49,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:49,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:49,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:49,958 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:49,966 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:49,974 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:49,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:49,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:49,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:49,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:49,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:49,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:49,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:49,998 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:50,061 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:50,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:50,062 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:50,062 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:50,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 12:32:50,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:50,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:50,098 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:50,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:50,099 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:50,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:50,099 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:50,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:50,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:50,099 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:50,099 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:50,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:50,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1440462342, now seen corresponding path program 67 times [2018-10-04 12:32:50,100 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:50,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:50,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:50,153 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:50,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:50,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:50,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:50,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:50,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:50,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,187 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:50,252 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 12:32:50,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:50,253 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:50,253 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:32:50,253 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:32:50,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:32:50,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 12:32:50,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:50,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:50,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 12:32:50,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:50,279 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:50,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:50,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:50,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:50,279 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:32:50,280 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:50,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:50,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1098654836, now seen corresponding path program 68 times [2018-10-04 12:32:50,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:50,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:50,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:50,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:50,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:50,357 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:50,361 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:50,361 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:50,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:50,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:50,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:50,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:50,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,385 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 12:32:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:50,486 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:50,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:50,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:50,487 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:50,487 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:50,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:32:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:50,530 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:50,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:50,530 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:50,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:50,531 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:50,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:50,531 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:50,531 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:50,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1098656758, now seen corresponding path program 69 times [2018-10-04 12:32:50,532 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:50,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:50,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:50,585 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:50,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:50,601 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:32:50,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:50,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:50,605 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:50,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:50,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:50,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:50,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,625 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:50,737 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:50,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:50,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:50,738 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:50,738 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:50,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:50,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:32:50,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:50,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:50,779 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:50,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:50,779 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:50,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:50,780 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:50,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:50,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:50,780 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:50,780 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:50,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:50,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1100501878, now seen corresponding path program 70 times [2018-10-04 12:32:50,780 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:50,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:50,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:50,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:50,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:50,849 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:50,849 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:50,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:50,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:50,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:50,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:50,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:50,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,872 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:50,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:50,978 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:50,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:50,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:50,979 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:50,979 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:50,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:32:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:51,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:51,024 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:51,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:51,025 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:51,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:51,025 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:51,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:51,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:51,025 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:51,025 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:51,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:51,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1100503800, now seen corresponding path program 71 times [2018-10-04 12:32:51,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:51,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:51,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:51,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:51,080 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:51,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:51,080 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:51,088 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:51,095 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:32:51,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:51,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:51,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:51,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:51,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:51,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:51,119 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:51,227 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:51,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:51,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:51,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:51,228 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:51,228 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:51,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:51,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 22. [2018-10-04 12:32:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:51,268 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:32:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:51,268 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:51,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:51,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:51,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:51,268 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:51,268 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:51,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:51,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1421305098, now seen corresponding path program 72 times [2018-10-04 12:32:51,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:51,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:51,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:51,365 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:51,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:51,365 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:51,382 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:51,382 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:51,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:51,385 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:51,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:51,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:51,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:51,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:51,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:51,406 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:32:51,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:51,550 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:51,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:51,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:51,551 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:51,551 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:51,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:51,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:32:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:51,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:51,595 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:51,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:51,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:51,596 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:51,596 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:51,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1421303176, now seen corresponding path program 73 times [2018-10-04 12:32:51,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:51,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:51,724 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:51,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:51,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:51,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:51,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:51,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:51,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:51,762 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:51,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:51,871 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:51,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:51,871 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:51,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:51,872 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:51,872 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:51,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:51,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:32:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:51,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:51,914 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:51,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:51,915 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:51,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:51,915 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:51,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:51,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:51,915 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:51,916 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:51,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:51,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1419458056, now seen corresponding path program 74 times [2018-10-04 12:32:51,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:51,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:51,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:51,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:51,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:51,975 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:51,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:51,990 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:51,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:51,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:51,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:52,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:52,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:52,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:52,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,013 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:52,119 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:32:52,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:52,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:52,120 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:32:52,120 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:32:52,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:32:52,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:32:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:52,166 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:52,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:52,166 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:52,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:52,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:52,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:52,166 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:52,167 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:52,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:52,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1419456134, now seen corresponding path program 75 times [2018-10-04 12:32:52,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:52,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:52,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:52,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:52,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:52,254 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:32:52,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:52,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:52,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:52,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:52,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,278 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:52,383 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:52,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:52,384 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:52,384 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:52,384 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:52,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 20. [2018-10-04 12:32:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:32:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:32:52,416 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 12:32:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:52,416 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:32:52,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:32:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:52,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:52,417 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:52,417 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:52,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:52,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1778713206, now seen corresponding path program 76 times [2018-10-04 12:32:52,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:52,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:52,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:52,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:52,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:52,491 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:52,492 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:52,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:52,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:52,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:52,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,516 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 12:32:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:52,619 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:52,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:52,620 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:52,620 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:52,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:32:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:52,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:52,668 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:52,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:52,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:52,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:52,669 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:52,669 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:52,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1778715128, now seen corresponding path program 77 times [2018-10-04 12:32:52,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:52,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:52,722 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:52,730 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:52,740 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:32:52,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:52,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:52,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:52,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:52,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:52,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,767 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:52,880 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:52,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:52,881 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:52,881 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:52,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2018-10-04 12:32:52,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:52,927 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:52,927 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:52,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:52,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:52,928 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:52,928 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:52,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1780560248, now seen corresponding path program 78 times [2018-10-04 12:32:52,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:52,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:52,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:52,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:52,995 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:53,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:53,010 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:53,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:53,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:53,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:53,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:53,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:53,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:53,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:53,036 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:53,155 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:32:53,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:53,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:53,156 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:32:53,156 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:32:53,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:32:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:32:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:53,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:53,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:53,213 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:53,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:53,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:53,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:53,214 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:53,214 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:53,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:53,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1780562170, now seen corresponding path program 79 times [2018-10-04 12:32:53,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:53,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:53,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:53,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:53,273 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:53,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:53,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:53,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:53,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:53,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:53,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:53,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:53,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:53,309 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:53,408 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:32:53,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:53,408 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:53,409 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:32:53,409 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:32:53,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:53,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:32:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2018-10-04 12:32:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:53,449 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:32:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:53,449 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:53,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:53,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:53,450 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:53,450 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:53,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash -741246728, now seen corresponding path program 80 times [2018-10-04 12:32:53,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:53,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:53,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:53,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:53,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:53,550 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:53,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:53,562 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:53,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:53,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:53,567 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:53,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:53,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:53,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:53,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:53,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:53,586 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:32:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:53,680 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:53,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:53,681 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:53,681 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:53,681 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:53,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:53,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2018-10-04 12:32:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:53,750 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:53,750 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:53,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:53,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:53,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:53,750 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:53,751 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:53,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:53,751 INFO L82 PathProgramCache]: Analyzing trace with hash -741244806, now seen corresponding path program 81 times [2018-10-04 12:32:53,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:53,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:53,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:53,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:53,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:53,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:53,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:53,993 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:32:53,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:53,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:54,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:54,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:54,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,017 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:54,104 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:32:54,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:54,104 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:54,105 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:32:54,105 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:32:54,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:32:54,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2018-10-04 12:32:54,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:54,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:54,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:54,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:54,145 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:54,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:54,145 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:54,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:54,146 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:54,146 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:54,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash -739399686, now seen corresponding path program 82 times [2018-10-04 12:32:54,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:54,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:54,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:54,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:54,225 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:54,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:54,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:54,240 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:54,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:54,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:54,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:54,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:54,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:54,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,266 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:54,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:54,351 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2018-10-04 12:32:54,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:54,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:54,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:54,353 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:32:54,353 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:32:54,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:32:54,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-04 12:32:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:54,402 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:54,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:54,402 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:54,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:54,402 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:54,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:54,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:54,402 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:32:54,402 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:54,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:54,403 INFO L82 PathProgramCache]: Analyzing trace with hash -739397764, now seen corresponding path program 83 times [2018-10-04 12:32:54,403 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:54,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:54,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:54,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:54,456 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:54,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:54,471 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:32:54,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:54,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:54,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:54,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:54,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,495 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:54,579 INFO L93 Difference]: Finished difference Result 30 states and 42 transitions. [2018-10-04 12:32:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:54,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:54,580 INFO L225 Difference]: With dead ends: 30 [2018-10-04 12:32:54,580 INFO L226 Difference]: Without dead ends: 28 [2018-10-04 12:32:54,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-04 12:32:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 18. [2018-10-04 12:32:54,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:32:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:32:54,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 12:32:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:54,613 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:32:54,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:32:54,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:54,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:54,614 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:32:54,614 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:54,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:54,614 INFO L82 PathProgramCache]: Analyzing trace with hash -189215756, now seen corresponding path program 84 times [2018-10-04 12:32:54,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:54,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:54,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:54,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:54,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:54,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:54,684 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:54,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:54,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:54,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:54,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:54,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:54,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,709 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 9 states. [2018-10-04 12:32:54,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:54,859 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:32:54,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:54,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:54,860 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:32:54,860 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:32:54,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:54,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:32:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:32:54,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:32:54,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:32:54,911 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:32:54,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:54,912 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:32:54,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:32:54,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:54,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:54,912 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:54,913 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:54,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash -189213834, now seen corresponding path program 85 times [2018-10-04 12:32:54,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:54,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:54,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:54,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:54,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:54,970 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:54,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:54,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:54,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:55,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:55,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:55,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:55,005 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:32:55,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:55,150 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:32:55,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:55,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:55,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:55,151 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:32:55,151 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:32:55,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:32:55,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 12:32:55,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:55,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:55,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:55,204 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:55,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:55,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:55,204 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:55,205 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:55,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:55,205 INFO L82 PathProgramCache]: Analyzing trace with hash -187368714, now seen corresponding path program 86 times [2018-10-04 12:32:55,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:55,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:55,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:55,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:55,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:55,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:55,285 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:55,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:55,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:55,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:55,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:55,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:55,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:55,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:55,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:55,322 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:55,486 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:32:55,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:55,486 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:55,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:55,487 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:32:55,487 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:32:55,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:32:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:32:55,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:32:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:32:55,544 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:32:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:55,544 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:32:55,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:55,544 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:32:55,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:55,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:55,544 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:55,544 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:55,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:55,545 INFO L82 PathProgramCache]: Analyzing trace with hash -187366792, now seen corresponding path program 87 times [2018-10-04 12:32:55,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:55,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:55,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:55,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:55,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:55,603 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:55,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:55,618 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:32:55,618 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:55,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:55,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:55,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:55,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:55,642 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:32:55,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:55,848 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:32:55,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:55,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:55,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:55,849 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:32:55,849 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:32:55,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:55,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:32:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 12:32:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:32:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:32:55,931 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:32:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:55,931 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:32:55,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:32:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:55,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:55,932 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:55,932 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:55,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1585791606, now seen corresponding path program 88 times [2018-10-04 12:32:55,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:55,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:55,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:55,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:56,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:56,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:56,709 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:56,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:56,755 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:56,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:56,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:56,758 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:56,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:56,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:56,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:56,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:56,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:56,796 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:32:57,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:57,370 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:32:57,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:57,371 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:57,371 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:32:57,371 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:32:57,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:57,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:32:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:32:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:32:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:32:57,464 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:32:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:57,464 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:32:57,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:32:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:57,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:57,465 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:57,466 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:57,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1585793528, now seen corresponding path program 89 times [2018-10-04 12:32:57,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:57,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:57,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:57,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:57,549 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:57,557 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:32:57,564 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:32:57,564 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:57,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:57,568 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:57,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:57,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:57,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:57,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:57,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:57,597 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:32:57,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:57,778 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:32:57,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:57,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:57,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:57,779 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:32:57,779 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:32:57,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:57,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:32:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 12:32:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:57,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:57,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:57,838 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:57,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:57,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:57,839 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:57,839 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:57,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:57,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1587638648, now seen corresponding path program 90 times [2018-10-04 12:32:57,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:57,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:57,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:57,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:57,933 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:57,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:57,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:57,941 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:32:57,948 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:32:57,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:57,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:57,952 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:57,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:57,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:57,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:57,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:57,976 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:58,134 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:32:58,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:58,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:58,136 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:32:58,136 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:32:58,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:58,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:32:58,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:32:58,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:32:58,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:32:58,203 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:32:58,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:58,203 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:32:58,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:58,203 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:32:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:58,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:58,204 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:58,204 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:58,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1587640570, now seen corresponding path program 91 times [2018-10-04 12:32:58,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:58,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:58,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:58,420 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:58,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:58,420 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:58,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:58,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:58,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:58,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:58,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:58,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:58,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:58,455 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:32:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:58,596 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:32:58,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:58,597 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:58,597 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:32:58,597 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:32:58,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:32:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 22. [2018-10-04 12:32:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:32:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:32:58,639 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:32:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:58,639 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:32:58,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:32:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:58,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:58,639 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:58,639 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:58,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 490842614, now seen corresponding path program 92 times [2018-10-04 12:32:58,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:58,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:58,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:58,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:32:58,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:58,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:58,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:58,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:32:58,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:32:58,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:58,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:58,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:58,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:58,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:58,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:58,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:58,738 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:32:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:58,893 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:32:58,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:58,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:58,894 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:32:58,894 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:32:58,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:32:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:32:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:32:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:32:58,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:32:58,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:58,957 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:32:58,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:32:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:58,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:58,957 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:58,957 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:58,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:58,957 INFO L82 PathProgramCache]: Analyzing trace with hash 490844536, now seen corresponding path program 93 times [2018-10-04 12:32:58,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:58,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:58,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:58,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:59,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:59,015 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:59,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:32:59,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:32:59,034 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:59,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:59,037 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:59,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:59,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:59,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:59,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:59,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:59,059 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:32:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:59,273 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:32:59,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:59,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:59,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:59,274 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:32:59,274 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:32:59,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:59,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:32:59,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 12:32:59,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:32:59,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:32:59,371 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:32:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:59,371 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:32:59,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:32:59,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:59,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:59,372 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:32:59,372 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:59,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:59,373 INFO L82 PathProgramCache]: Analyzing trace with hash 492689656, now seen corresponding path program 94 times [2018-10-04 12:32:59,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:59,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:59,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:59,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:32:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:59,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:32:59,601 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:32:59,608 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:32:59,612 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:32:59,613 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:32:59,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:32:59,616 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:32:59,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:32:59,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:32:59,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:32:59,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:32:59,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:59,637 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:32:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:32:59,780 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:32:59,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:32:59,780 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:32:59,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:32:59,781 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:32:59,781 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:32:59,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:32:59,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:32:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:32:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:32:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:32:59,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:32:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:32:59,838 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:32:59,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:32:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:32:59,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:32:59,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:32:59,839 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:32:59,839 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:32:59,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:32:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash 492691578, now seen corresponding path program 95 times [2018-10-04 12:32:59,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:32:59,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:32:59,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:59,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:32:59,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:32:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:00,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:00,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:00,109 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:00,117 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:33:00,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:00,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:00,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:00,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:00,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:00,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:00,141 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:00,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:00,283 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:00,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:00,284 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:00,284 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:00,284 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:00,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 12:33:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:00,335 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:33:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:00,335 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:00,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:00,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:00,336 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:33:00,336 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:00,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2029117320, now seen corresponding path program 96 times [2018-10-04 12:33:00,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:00,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:00,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:00,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:00,389 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:00,396 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:00,406 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:00,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:00,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:00,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:00,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:00,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:00,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:00,430 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:33:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:00,563 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:00,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:00,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:00,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:00,564 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:00,564 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:00,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:00,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:00,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:33:00,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:00,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:00,625 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:00,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:00,625 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:00,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:00,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:00,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:00,626 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:00,626 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:00,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2029115398, now seen corresponding path program 97 times [2018-10-04 12:33:00,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:00,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:00,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:00,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:00,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:00,727 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:00,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:00,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:00,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:00,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:00,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:00,763 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:00,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:00,915 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:00,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:00,916 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:00,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:00,916 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:00,916 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:00,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:00,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 12:33:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:00,972 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:33:00,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:00,972 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:00,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:00,972 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:00,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:00,973 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:00,973 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:00,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2027270278, now seen corresponding path program 98 times [2018-10-04 12:33:00,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:00,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:01,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:01,027 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:01,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:01,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:01,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:01,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:01,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:01,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:01,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:01,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:01,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:01,063 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:33:01,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:01,207 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:01,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:01,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:01,208 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:01,208 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:01,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:33:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:01,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:01,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:01,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:01,268 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:01,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:01,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:01,268 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:33:01,268 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:01,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:01,268 INFO L82 PathProgramCache]: Analyzing trace with hash -2027268356, now seen corresponding path program 99 times [2018-10-04 12:33:01,268 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:01,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:01,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:01,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:01,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:01,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:01,349 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:01,357 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:33:01,357 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:01,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:01,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:01,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:01,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:01,381 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:01,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:01,508 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:01,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:01,508 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:01,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:01,509 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:01,509 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:01,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 20. [2018-10-04 12:33:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:33:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:33:01,552 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 15 [2018-10-04 12:33:01,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:01,552 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:33:01,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:33:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:01,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:01,553 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:01,553 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:01,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash 511848822, now seen corresponding path program 100 times [2018-10-04 12:33:01,553 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:01,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:01,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:01,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:01,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:01,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:01,637 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:01,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:01,651 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:01,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:01,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:01,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:01,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:01,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:01,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:01,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:01,677 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 9 states. [2018-10-04 12:33:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:01,873 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:01,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:01,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:01,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:01,874 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:01,874 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:01,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:01,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:33:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:01,949 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:01,949 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:01,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:01,949 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:01,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:01,949 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:33:01,950 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:01,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash 511850744, now seen corresponding path program 101 times [2018-10-04 12:33:01,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:01,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:01,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:01,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:01,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:02,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:02,024 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:33:02,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:02,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:02,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:02,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:02,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:02,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:02,048 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:02,212 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:02,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:02,214 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:02,214 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:02,215 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:02,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:02,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 12:33:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:02,300 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:33:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:02,300 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:02,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:02,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:02,301 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:33:02,301 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:02,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:02,301 INFO L82 PathProgramCache]: Analyzing trace with hash 513695864, now seen corresponding path program 102 times [2018-10-04 12:33:02,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:02,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:02,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:02,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:02,353 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:02,360 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:02,368 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:02,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:02,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:02,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:02,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:02,393 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:33:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:02,546 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:02,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:02,547 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:02,547 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:02,548 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:02,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 12:33:02,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:02,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:02,620 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:02,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:02,620 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:02,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:02,621 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:02,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:02,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:02,621 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:02,621 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:02,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:02,621 INFO L82 PathProgramCache]: Analyzing trace with hash 513697786, now seen corresponding path program 103 times [2018-10-04 12:33:02,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:02,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:02,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:02,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:02,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:02,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:02,676 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:02,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:02,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:02,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:02,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:02,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:02,710 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:02,857 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:02,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:02,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:02,863 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:02,863 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:02,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:02,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2018-10-04 12:33:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:02,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:02,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:33:02,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:02,920 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:02,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:02,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:02,921 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:33:02,921 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:02,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash -2008111112, now seen corresponding path program 104 times [2018-10-04 12:33:02,921 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:02,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:02,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:02,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:02,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:02,976 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:02,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:02,976 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:02,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:02,993 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:02,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:02,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:03,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:03,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:03,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:03,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:03,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:03,015 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:33:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:03,160 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:03,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:03,161 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:03,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:03,161 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:03,161 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:03,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:03,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:33:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:03,232 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:03,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:03,233 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:03,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:03,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:03,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:03,233 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:03,233 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:03,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:03,233 INFO L82 PathProgramCache]: Analyzing trace with hash -2008109190, now seen corresponding path program 105 times [2018-10-04 12:33:03,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:03,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:03,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:03,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:03,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:03,288 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:03,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:03,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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:03,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:03,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:33:03,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:03,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:03,307 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:03,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:03,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:03,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:03,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:03,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:03,327 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:03,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:03,475 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:03,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:03,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:03,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:03,476 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:03,476 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:03,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:03,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:03,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 12:33:03,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:03,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:03,537 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:33:03,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:03,537 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:03,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:03,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:03,538 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:03,538 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:03,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:03,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2006264070, now seen corresponding path program 106 times [2018-10-04 12:33:03,538 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:03,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:03,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:03,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:03,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:03,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:03,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:03,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:03,622 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:03,623 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:03,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:03,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:03,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:03,646 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:33:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:03,796 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:03,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:03,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:03,797 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:03,797 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:03,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:03,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 12:33:03,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:03,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:03,864 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:03,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:03,864 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:03,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:03,864 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:03,865 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:03,865 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:33:03,865 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash -2006262148, now seen corresponding path program 107 times [2018-10-04 12:33:03,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:03,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:03,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:03,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:03,924 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:03,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:03,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:03,932 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:03,939 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:33:03,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:03,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:03,943 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:03,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:03,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:03,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:03,964 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:04,093 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:04,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:04,094 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:04,094 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:04,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:04,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 22. [2018-10-04 12:33:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:33:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:33:04,148 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 15 [2018-10-04 12:33:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:04,148 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:33:04,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:33:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:04,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:04,149 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-10-04 12:33:04,149 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:04,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1191907192, now seen corresponding path program 108 times [2018-10-04 12:33:04,149 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:04,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:04,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:04,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:04,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:04,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:04,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:04,212 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:04,220 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:04,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:04,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:04,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:04,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:04,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:04,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:04,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:04,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:04,245 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 9 states. [2018-10-04 12:33:04,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:04,375 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:04,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:04,376 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:04,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:04,376 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:04,376 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:04,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:33:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:04,446 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:04,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:04,446 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:04,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:04,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:04,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:04,447 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:04,447 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:04,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:04,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1191909114, now seen corresponding path program 109 times [2018-10-04 12:33:04,447 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:04,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:04,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:04,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:04,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:04,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:04,783 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:04,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:04,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:04,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:04,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:04,817 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:04,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:04,943 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:33:04,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:04,944 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:04,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:04,944 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:33:04,944 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:33:04,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:04,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:33:05,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-10-04 12:33:05,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:05,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:05,016 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:33:05,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:05,016 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:05,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:05,016 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:05,016 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:05,016 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:05,017 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:05,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1193754234, now seen corresponding path program 110 times [2018-10-04 12:33:05,017 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:05,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:05,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:05,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:05,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:05,079 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:05,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:05,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:05,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:05,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:05,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:05,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:05,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:05,126 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:33:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:05,325 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:05,326 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:05,326 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:05,326 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:05,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:33:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:05,396 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:05,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:05,396 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:05,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:05,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:05,397 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:33:05,397 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:05,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1193756156, now seen corresponding path program 111 times [2018-10-04 12:33:05,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:05,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:05,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:05,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:05,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:05,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:05,488 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:05,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:05,502 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-10-04 12:33:05,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:05,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:05,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:05,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:05,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:05,526 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:05,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:05,661 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:33:05,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:05,662 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:05,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:05,662 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:33:05,662 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:33:05,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:33:05,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2018-10-04 12:33:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:05,759 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 15 [2018-10-04 12:33:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:05,759 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:05,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:05,759 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:05,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:05,760 INFO L375 BasicCegarLoop]: trace histogram [6, 4, 2, 1, 1, 1] [2018-10-04 12:33:05,760 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:05,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1328052742, now seen corresponding path program 112 times [2018-10-04 12:33:05,760 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:05,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:05,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:05,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:05,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:06,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:06,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:06,090 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:06,095 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:06,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:06,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:06,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:06,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:06,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:06,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:06,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:06,119 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 9 states. [2018-10-04 12:33:06,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:06,241 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:33:06,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:06,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:06,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:06,242 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:33:06,242 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:33:06,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:33:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2018-10-04 12:33:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:06,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:06,327 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:06,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:06,327 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:06,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:06,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:06,328 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:33:06,328 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:06,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1328050820, now seen corresponding path program 113 times [2018-10-04 12:33:06,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:06,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:06,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:06,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:06,388 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:06,405 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:06,411 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-04 12:33:06,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:06,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:06,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:06,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:06,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:06,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:06,435 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:06,580 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:33:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:06,581 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:06,581 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:33:06,581 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:33:06,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:06,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:33:06,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 26. [2018-10-04 12:33:06,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:06,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:06,656 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 15 [2018-10-04 12:33:06,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:06,656 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:06,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:06,656 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:06,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:06,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:06,657 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-10-04 12:33:06,657 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:06,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:06,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1326205700, now seen corresponding path program 114 times [2018-10-04 12:33:06,657 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:06,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:06,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:06,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:06,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:06,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:06,782 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:06,800 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:06,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:06,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:06,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:06,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:06,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:06,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:06,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:06,824 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 9 states. [2018-10-04 12:33:06,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:06,931 INFO L93 Difference]: Finished difference Result 33 states and 46 transitions. [2018-10-04 12:33:06,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:06,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:06,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:06,932 INFO L225 Difference]: With dead ends: 33 [2018-10-04 12:33:06,932 INFO L226 Difference]: Without dead ends: 31 [2018-10-04 12:33:06,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:06,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-04 12:33:07,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2018-10-04 12:33:07,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:07,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:07,007 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 15 [2018-10-04 12:33:07,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:07,007 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:07,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:07,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:07,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:33:07,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:07,007 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1] [2018-10-04 12:33:07,008 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:07,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:07,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1326203778, now seen corresponding path program 6 times [2018-10-04 12:33:07,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:07,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:07,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:07,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:07,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:07,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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:07,815 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:07,822 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:33:07,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:07,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:07,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:07,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:07,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:33:07,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:33:07,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:33:07,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:07,848 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 9 states. [2018-10-04 12:33:07,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:07,980 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2018-10-04 12:33:07,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:33:07,981 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-10-04 12:33:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:07,981 INFO L225 Difference]: With dead ends: 32 [2018-10-04 12:33:07,981 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:33:07,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:33:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:33:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 18. [2018-10-04 12:33:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 12:33:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2018-10-04 12:33:08,054 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2018-10-04 12:33:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:08,054 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 25 transitions. [2018-10-04 12:33:08,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:33:08,055 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 25 transitions. [2018-10-04 12:33:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:08,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:08,055 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 12:33:08,055 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:08,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash -168156555, now seen corresponding path program 7 times [2018-10-04 12:33:08,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:08,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:08,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:08,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:08,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:08,259 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:08,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:08,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:08,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:08,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:08,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:08,297 INFO L87 Difference]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2018-10-04 12:33:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:08,506 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:08,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:08,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:08,508 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:08,508 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:08,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:08,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:08,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:08,598 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:08,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:08,599 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:08,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:08,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:08,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:08,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:08,599 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:08,599 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:08,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:08,600 INFO L82 PathProgramCache]: Analyzing trace with hash -168154633, now seen corresponding path program 115 times [2018-10-04 12:33:08,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:08,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:08,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:08,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:08,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:08,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:08,666 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:08,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:08,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:08,687 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:08,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:08,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:08,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:08,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:08,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:08,709 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:08,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:08,920 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:08,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:08,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:08,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:08,921 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:08,921 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:08,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:09,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:33:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:09,014 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:09,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:09,014 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:09,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:09,014 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:09,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:09,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:09,014 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:09,015 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:09,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:09,015 INFO L82 PathProgramCache]: Analyzing trace with hash -166309513, now seen corresponding path program 116 times [2018-10-04 12:33:09,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:09,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:09,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:09,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:09,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:09,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:09,074 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:09,081 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:09,087 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:09,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:09,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:09,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:09,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:09,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:09,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:09,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:09,117 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:09,346 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:09,346 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:09,347 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:09,347 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:09,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:09,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:09,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:09,435 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:09,435 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:09,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:09,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:09,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:09,436 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:09,436 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:09,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:09,436 INFO L82 PathProgramCache]: Analyzing trace with hash -166307591, now seen corresponding path program 117 times [2018-10-04 12:33:09,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:09,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:09,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:09,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:09,516 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:09,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:09,534 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:09,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:09,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:09,537 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:09,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:09,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:09,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:09,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:09,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:09,558 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:09,765 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:09,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:09,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:09,766 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:09,766 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:09,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:09,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:33:09,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:09,848 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:09,848 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:09,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:09,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:09,849 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:09,849 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:09,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:09,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1606850807, now seen corresponding path program 118 times [2018-10-04 12:33:09,849 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:09,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:09,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:09,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:09,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:09,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:09,910 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:09,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:09,924 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:09,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:09,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:09,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:09,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:09,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:09,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:09,947 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:10,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:10,139 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:10,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:10,140 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:10,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:10,140 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:10,140 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:10,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:10,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:33:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:10,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:10,235 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:10,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:10,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:10,236 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:10,236 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:10,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:10,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1606852729, now seen corresponding path program 119 times [2018-10-04 12:33:10,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:10,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:10,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:10,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:10,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:10,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:10,329 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:10,338 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:10,347 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:10,347 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:10,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:10,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:10,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:10,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:10,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:10,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:10,371 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:10,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:10,565 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:10,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:10,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:10,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:10,566 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:10,566 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:10,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:10,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:33:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:10,659 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:10,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:10,660 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:10,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:10,660 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:10,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:10,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:10,660 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:10,660 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:10,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:10,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1608697849, now seen corresponding path program 120 times [2018-10-04 12:33:10,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:10,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:10,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:10,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:10,729 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:10,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:10,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:10,737 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:10,747 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:10,747 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:10,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:10,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:10,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:10,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:10,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:10,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:10,773 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:10,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:10,969 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:10,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:10,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:10,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:10,970 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:10,970 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:10,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:10,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:11,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:11,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:11,059 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:11,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:11,059 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:11,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:11,059 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:11,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:11,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:11,060 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:11,060 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:11,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:11,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1608699771, now seen corresponding path program 121 times [2018-10-04 12:33:11,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:11,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:11,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:11,124 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:11,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:11,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:11,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:11,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:11,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:11,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:11,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:11,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:11,160 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:11,356 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:11,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:11,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:11,357 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:11,357 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:11,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:11,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:11,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 12:33:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:11,427 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:33:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:11,428 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:11,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:11,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:11,428 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:11,429 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:11,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:11,429 INFO L82 PathProgramCache]: Analyzing trace with hash 511901815, now seen corresponding path program 122 times [2018-10-04 12:33:11,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:11,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:11,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:11,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:11,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:11,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:11,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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:11,517 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:11,523 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:11,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:11,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:11,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:11,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:11,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:11,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:11,547 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:33:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:11,774 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:11,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:11,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:11,775 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:11,775 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:11,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:11,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:11,864 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:11,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:11,864 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:11,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:11,864 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:11,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:11,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:11,864 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:11,864 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:11,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:11,865 INFO L82 PathProgramCache]: Analyzing trace with hash 511903737, now seen corresponding path program 123 times [2018-10-04 12:33:11,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:11,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:11,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:11,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:11,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:11,980 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:11,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:11,980 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:11,989 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:11,998 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:11,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:11,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:12,002 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:12,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:12,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:12,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:12,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:12,032 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:12,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:12,765 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:12,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:12,765 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:12,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:12,765 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:12,765 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:12,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:12,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:33:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:12,859 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:12,859 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:12,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:12,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:12,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:12,859 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:12,859 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:12,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:12,860 INFO L82 PathProgramCache]: Analyzing trace with hash 513748857, now seen corresponding path program 124 times [2018-10-04 12:33:12,860 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:12,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:12,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:12,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:12,938 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:12,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:12,939 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:12,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:12,951 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:12,952 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:12,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:12,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:12,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:12,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:12,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:12,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:12,975 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:13,191 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:13,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:13,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:13,192 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:13,192 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:13,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:13,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:13,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:13,288 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:13,288 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:13,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:13,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:13,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:13,289 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:13,289 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:13,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:13,289 INFO L82 PathProgramCache]: Analyzing trace with hash 513750779, now seen corresponding path program 125 times [2018-10-04 12:33:13,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:13,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:13,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:13,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:13,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:13,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:13,464 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:13,471 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:13,480 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:13,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:13,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:13,483 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:13,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:13,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:13,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:13,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:13,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:13,504 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:13,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:13,706 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:13,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:13,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:13,707 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:13,707 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:13,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:33:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:13,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:13,788 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:13,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:13,788 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:13,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:13,788 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:13,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:13,789 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:13,789 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:13,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2008058119, now seen corresponding path program 126 times [2018-10-04 12:33:13,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:13,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:13,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:13,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:13,859 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:13,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:13,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:13,866 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:13,874 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:13,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:13,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:13,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:13,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:13,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:13,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:13,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:13,902 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:14,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:14,106 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:14,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:14,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:14,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:14,107 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:14,107 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:14,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:14,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:33:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:14,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:14,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:14,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:14,199 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:14,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:14,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:14,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:14,199 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:14,200 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:14,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:14,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2008056197, now seen corresponding path program 127 times [2018-10-04 12:33:14,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:14,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:14,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:14,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:14,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:14,504 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:14,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:14,504 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:14,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:14,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:14,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:14,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:14,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:14,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:14,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:14,541 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:14,735 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:14,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:14,736 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:14,736 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:14,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:14,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:33:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:14,827 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:14,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:14,827 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:14,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:14,827 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:14,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:14,828 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:14,828 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:14,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2006211077, now seen corresponding path program 128 times [2018-10-04 12:33:14,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:14,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:14,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:14,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:14,963 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:14,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:14,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:14,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:14,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:15,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:15,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:15,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:15,002 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:15,207 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:15,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:15,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:15,208 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:15,208 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:15,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:15,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:15,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:15,333 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:15,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:15,333 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:15,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:15,333 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:15,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:15,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:15,334 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:15,334 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:15,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:15,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2006209155, now seen corresponding path program 129 times [2018-10-04 12:33:15,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:15,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:15,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:15,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:15,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:15,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:15,416 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:15,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:15,432 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:15,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:15,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:15,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:15,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:15,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:15,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:15,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:15,455 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:15,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:15,663 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:15,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:15,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:15,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:15,664 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:15,664 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:15,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:15,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 12:33:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:33:15,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:33:15,740 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 12:33:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:15,740 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:33:15,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:33:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:15,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:15,740 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:15,741 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:15,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash 532908023, now seen corresponding path program 130 times [2018-10-04 12:33:15,741 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:15,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:15,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:15,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:15,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:15,800 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:15,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:15,815 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:15,815 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:15,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:15,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:15,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:15,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:15,840 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 12:33:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:16,056 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:16,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:16,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:16,057 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:16,057 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:16,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:16,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:16,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:16,155 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:16,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:16,155 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:16,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:16,155 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:16,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:16,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:16,156 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:16,156 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:16,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:16,156 INFO L82 PathProgramCache]: Analyzing trace with hash 532909945, now seen corresponding path program 131 times [2018-10-04 12:33:16,156 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:16,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:16,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:16,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:16,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:16,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:16,227 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:16,236 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:16,244 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:16,244 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:16,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:16,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:16,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:16,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:16,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:16,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:16,273 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:16,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:16,499 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:16,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:16,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:16,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:16,500 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:16,500 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:16,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:16,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:33:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:16,598 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:16,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:16,598 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:16,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:16,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:16,598 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:16,598 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:16,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:16,598 INFO L82 PathProgramCache]: Analyzing trace with hash 534755065, now seen corresponding path program 132 times [2018-10-04 12:33:16,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:16,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:16,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:16,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:16,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:16,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:16,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:16,671 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:16,679 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:16,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:16,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:16,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:16,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:16,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:16,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:16,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:16,703 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:16,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:16,902 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:16,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:16,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:16,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:16,903 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:16,903 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:16,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:16,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:33:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:17,008 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:17,008 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:17,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:17,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:17,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:17,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:17,009 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:17,009 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:17,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:17,009 INFO L82 PathProgramCache]: Analyzing trace with hash 534756987, now seen corresponding path program 133 times [2018-10-04 12:33:17,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:17,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:17,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:17,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:17,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:17,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 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:17,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:17,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:17,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:17,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:17,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:17,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:17,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:17,149 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:17,348 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:17,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:17,349 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:17,349 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:17,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:33:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:17,441 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:17,441 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:17,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:17,441 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:17,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:17,441 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:17,442 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:17,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1987051911, now seen corresponding path program 134 times [2018-10-04 12:33:17,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:17,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:17,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:17,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:17,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:17,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 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:17,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:17,522 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:17,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:17,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:17,526 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:17,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:17,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:17,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:17,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:17,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:17,546 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:17,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:17,760 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:17,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:17,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:17,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:17,761 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:17,761 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:17,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:17,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:17,870 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:17,870 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:17,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:17,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:17,870 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:17,871 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:17,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1987049989, now seen corresponding path program 135 times [2018-10-04 12:33:17,871 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:17,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:17,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:17,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:17,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:17,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:17,934 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:17,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:17,950 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:17,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:17,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:17,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:17,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:17,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:17,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:17,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:17,976 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:18,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:18,195 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:18,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:18,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:18,196 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:18,196 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:18,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:18,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:18,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:33:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:18,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:18,300 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:18,300 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:18,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:18,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:18,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:18,301 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:18,301 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:18,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1985204869, now seen corresponding path program 136 times [2018-10-04 12:33:18,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:18,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:18,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:18,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:18,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:18,365 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:18,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:18,379 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:18,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:18,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:18,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:18,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:18,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:18,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:18,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:18,403 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:18,622 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:18,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:18,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:18,623 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:18,623 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:18,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:18,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:33:18,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:18,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:18,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:18,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:18,733 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:18,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:18,733 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:18,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:18,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:18,734 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:18,734 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:18,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:18,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1985202947, now seen corresponding path program 137 times [2018-10-04 12:33:18,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:18,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:18,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:18,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:18,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:18,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:18,792 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:18,801 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:18,810 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:18,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:18,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:18,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:18,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:18,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:18,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:18,834 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:19,030 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:19,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:19,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:19,031 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:19,031 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:19,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:19,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:33:19,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:19,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:19,112 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:33:19,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:19,112 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:19,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:19,112 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:19,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:19,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:19,112 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:19,112 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:19,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:19,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1212966393, now seen corresponding path program 138 times [2018-10-04 12:33:19,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:19,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:19,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:19,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:19,308 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:19,315 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:19,324 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:19,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:19,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:19,327 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:19,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:19,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:19,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:19,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:19,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:19,348 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:33:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:19,535 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:19,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:19,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:19,536 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:19,536 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:19,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:19,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:33:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:19,649 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:19,649 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:19,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:19,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:19,650 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:19,650 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:19,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1212968315, now seen corresponding path program 139 times [2018-10-04 12:33:19,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:19,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:19,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:19,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:19,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:19,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:19,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:19,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:19,809 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:19,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:19,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:19,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:19,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:19,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:19,830 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:20,013 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:20,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:20,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:20,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:20,014 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:20,014 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:20,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:20,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:33:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:20,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:20,141 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:20,141 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:20,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:20,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:20,141 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:20,142 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:20,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:20,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1214813435, now seen corresponding path program 140 times [2018-10-04 12:33:20,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:20,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:20,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:20,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:20,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:20,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:20,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:20,236 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:20,236 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:20,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:20,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:20,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:20,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:20,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:20,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:20,259 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:20,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:20,477 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:20,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:20,477 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:20,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:20,478 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:20,478 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:20,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:20,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:33:20,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:20,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:20,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:20,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:20,599 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:20,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:20,599 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:20,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:20,599 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:20,599 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:20,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:20,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1214815357, now seen corresponding path program 141 times [2018-10-04 12:33:20,600 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:20,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:20,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:20,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:20,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:20,660 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:20,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:20,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:20,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:20,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:20,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:20,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:20,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:20,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:20,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:20,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:20,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:20,702 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:20,909 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:20,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:20,910 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:20,910 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:20,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:33:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:21,014 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:21,015 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:21,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:21,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:21,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:21,015 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:21,015 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:21,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:21,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1306993541, now seen corresponding path program 142 times [2018-10-04 12:33:21,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:21,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:21,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:21,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:21,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:21,082 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:21,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:21,094 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:21,094 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:21,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:21,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:21,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:21,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:21,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:21,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:21,117 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:21,301 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:33:21,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:21,302 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:21,302 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:33:21,302 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:33:21,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:33:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 12:33:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:21,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:21,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:21,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:21,412 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:21,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:21,412 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:21,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:21,412 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:21,412 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:21,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1306991619, now seen corresponding path program 143 times [2018-10-04 12:33:21,412 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:21,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:21,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:21,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:21,498 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:21,507 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:21,516 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:21,516 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:21,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:21,520 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:21,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:21,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:21,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:21,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:21,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:21,541 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:21,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:21,723 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:33:21,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:21,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:21,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:21,724 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:33:21,724 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:33:21,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:21,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:33:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 12:33:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:21,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:21,824 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:21,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:21,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:21,824 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:21,824 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:21,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1305146499, now seen corresponding path program 144 times [2018-10-04 12:33:21,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:21,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:21,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:21,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:21,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:21,886 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:21,894 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:21,905 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:21,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:21,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:21,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:21,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:21,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:21,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:21,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:21,929 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:22,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:22,085 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:33:22,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:22,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:22,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:22,086 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:33:22,086 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:33:22,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:33:22,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 12:33:22,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:22,199 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:22,199 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:22,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:22,199 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:22,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:22,200 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:22,200 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:22,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1305144577, now seen corresponding path program 145 times [2018-10-04 12:33:22,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:22,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:22,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:22,201 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:22,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:22,351 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:22,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:22,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:22,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:22,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:22,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:22,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:22,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:22,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:22,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:22,391 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:22,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:22,547 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 12:33:22,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:22,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:22,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:22,548 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:33:22,548 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:33:22,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:33:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 12:33:22,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:33:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:33:22,615 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 12:33:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:22,615 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:33:22,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:22,615 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:33:22,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:22,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:22,615 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:22,616 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:22,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:22,616 INFO L82 PathProgramCache]: Analyzing trace with hash -754962569, now seen corresponding path program 146 times [2018-10-04 12:33:22,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:22,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:22,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:22,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:22,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:22,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:22,681 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:22,688 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:22,694 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:22,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:22,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:22,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:22,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:22,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:22,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:22,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:22,728 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 12:33:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:23,030 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:23,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:23,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:23,031 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:23,031 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:23,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:23,154 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:23,154 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:23,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:23,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:23,155 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:23,155 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:23,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash -754960647, now seen corresponding path program 147 times [2018-10-04 12:33:23,155 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:23,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:23,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:23,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:23,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:23,217 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:23,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:23,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:23,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:23,233 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:23,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:23,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:23,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:23,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:23,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:23,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:23,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:23,258 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:23,533 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:23,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:23,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:23,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:23,534 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:23,534 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:23,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:23,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:33:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:23,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:23,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:23,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:23,669 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:23,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:23,669 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:23,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:23,669 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:23,670 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:23,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash -753115527, now seen corresponding path program 148 times [2018-10-04 12:33:23,670 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:23,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:23,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:23,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:23,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:23,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:23,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:23,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:23,756 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:23,756 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:23,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:23,760 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:23,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:23,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:23,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:23,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:23,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:23,783 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:24,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:24,065 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:24,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:24,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:24,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:24,066 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:24,066 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:24,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:24,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:24,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:24,196 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:24,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:24,196 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:24,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:24,196 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:24,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:24,196 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:24,197 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:24,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:24,197 INFO L82 PathProgramCache]: Analyzing trace with hash -753113605, now seen corresponding path program 149 times [2018-10-04 12:33:24,197 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:24,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:24,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:24,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:24,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:24,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:24,359 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:24,366 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:24,374 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:24,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:24,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:24,378 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:24,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:24,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:24,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:24,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:24,399 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:24,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:24,652 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:24,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:24,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:24,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:24,653 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:24,653 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:24,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:24,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:33:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:24,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:24,760 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:24,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:24,760 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:24,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:24,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:24,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:24,760 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:24,760 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:24,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:24,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1020044793, now seen corresponding path program 150 times [2018-10-04 12:33:24,761 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:24,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:24,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:24,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:24,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:24,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:24,828 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:24,837 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:24,837 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:24,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:24,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:24,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:24,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:24,867 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:25,127 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:25,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:25,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:25,128 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:25,128 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:25,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:25,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:25,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:33:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:25,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:25,251 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:25,251 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:25,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:25,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:25,251 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:25,251 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:25,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:25,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1020046715, now seen corresponding path program 151 times [2018-10-04 12:33:25,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:25,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:25,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:25,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:25,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:25,313 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:25,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:25,314 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:25,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:25,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:25,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:25,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:25,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:25,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:25,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:25,352 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:25,623 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:25,623 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:25,624 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:25,624 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:25,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:25,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:25,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:33:25,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:25,748 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:25,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:25,749 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:25,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:25,749 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:25,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:25,749 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:25,749 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:25,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1021891835, now seen corresponding path program 152 times [2018-10-04 12:33:25,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:25,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:25,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:25,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:25,830 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 166 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:25,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:25,845 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:25,845 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:25,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:25,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:25,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:25,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:25,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:25,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:25,868 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:26,109 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:26,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:26,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:26,110 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:26,110 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:26,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:26,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:26,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:26,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:26,235 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:26,235 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:26,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:26,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:26,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:26,236 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:26,236 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:26,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:26,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1021893757, now seen corresponding path program 153 times [2018-10-04 12:33:26,236 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:26,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:26,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:26,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:26,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:26,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:26,297 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 167 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:26,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:26,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:26,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:26,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:26,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:26,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:26,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:26,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:26,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:26,337 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:26,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:26,570 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:26,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:26,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:26,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:26,571 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:26,571 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:26,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:26,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:26,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2018-10-04 12:33:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:26,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:26,688 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:33:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:26,688 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:26,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:26,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:26,688 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:26,688 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:26,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash -74904199, now seen corresponding path program 154 times [2018-10-04 12:33:26,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:26,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:26,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:26,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:26,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:26,749 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 168 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:26,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:26,779 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:26,779 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:26,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:26,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:26,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:26,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:26,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:26,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:26,802 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:33:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:27,090 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:27,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:27,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:27,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:27,091 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:27,091 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:27,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:27,211 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:27,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:27,211 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:27,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:27,211 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:27,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:27,211 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:27,212 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:27,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:27,212 INFO L82 PathProgramCache]: Analyzing trace with hash -74902277, now seen corresponding path program 155 times [2018-10-04 12:33:27,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:27,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:27,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:27,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:27,267 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:27,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:27,268 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 169 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:27,276 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:27,289 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:27,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:27,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:27,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:27,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:27,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:27,312 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:27,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:27,585 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:27,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:27,586 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:27,586 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:27,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:27,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 28. [2018-10-04 12:33:27,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:27,705 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:27,705 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:27,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:27,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:27,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:27,706 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:27,706 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:27,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:27,706 INFO L82 PathProgramCache]: Analyzing trace with hash -73057157, now seen corresponding path program 156 times [2018-10-04 12:33:27,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:27,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:27,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:27,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:27,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:27,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:27,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 170 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:27,808 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:27,808 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:27,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:27,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:27,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:27,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:27,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:27,833 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:28,124 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:28,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:28,125 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:28,125 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:28,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:28,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:28,249 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:28,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:28,249 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:28,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:28,249 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:28,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:28,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:28,249 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:28,249 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:28,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:28,250 INFO L82 PathProgramCache]: Analyzing trace with hash -73055235, now seen corresponding path program 157 times [2018-10-04 12:33:28,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:28,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:28,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:28,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:28,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:28,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:28,313 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 171 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:28,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:28,332 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:28,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:28,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:28,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:28,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:28,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:28,353 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:28,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:28,618 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:28,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:28,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:28,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:28,619 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:28,619 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:28,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:28,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:33:28,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:28,740 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:28,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:28,741 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:28,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:28,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:28,741 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:28,741 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:28,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:28,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1700103163, now seen corresponding path program 158 times [2018-10-04 12:33:28,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:28,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:28,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:28,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:28,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:28,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:28,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 172 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:28,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:28,822 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:28,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:28,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:28,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:28,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:28,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:28,846 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:29,120 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:29,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:29,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:29,121 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:29,121 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:29,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:33:29,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:29,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:29,247 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:29,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:29,247 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:29,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:29,247 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:29,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:29,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:29,248 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:29,248 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:29,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:29,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1700105085, now seen corresponding path program 159 times [2018-10-04 12:33:29,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:29,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:29,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:29,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:29,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:29,311 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:29,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:29,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 173 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:29,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:29,330 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:29,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:29,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:29,333 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:29,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:29,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:29,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:29,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:29,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:29,358 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:29,622 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:29,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:29,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:29,623 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:29,623 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:29,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:29,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:33:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:29,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:29,755 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:29,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:29,755 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:29,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:29,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:29,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:29,755 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:29,755 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:29,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:29,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1701950205, now seen corresponding path program 160 times [2018-10-04 12:33:29,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:29,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:29,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:29,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:29,816 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:29,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:29,816 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 174 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:29,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:29,830 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:29,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:29,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:29,833 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:29,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:29,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:29,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:29,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:29,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:29,859 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:30,110 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:30,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:30,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:30,111 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:30,111 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:30,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:30,255 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:30,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:30,256 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:30,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:30,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:30,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:30,256 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:30,256 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:30,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:30,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1701952127, now seen corresponding path program 161 times [2018-10-04 12:33:30,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:30,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:30,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:30,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:30,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:30,328 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 12:33:30,341 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 175 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:30,367 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:30,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:30,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:30,370 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:30,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:30,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:30,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:30,391 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:30,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:30,809 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:30,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:30,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:30,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:30,810 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:30,810 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:30,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 22. [2018-10-04 12:33:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:33:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:33:30,973 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 12:33:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:30,973 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:33:30,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:33:30,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:30,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:30,973 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:30,974 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:30,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:30,974 INFO L82 PathProgramCache]: Analyzing trace with hash -53897991, now seen corresponding path program 162 times [2018-10-04 12:33:30,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:30,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:30,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:30,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:31,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:31,964 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 176 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:32,074 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:32,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:32,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:32,077 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:32,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:32,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:32,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:32,099 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 12:33:32,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:32,339 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:32,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:32,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:32,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:32,340 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:32,340 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:32,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:32,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:32,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:32,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:32,483 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:32,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:32,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:32,483 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:32,483 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:32,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash -53896069, now seen corresponding path program 163 times [2018-10-04 12:33:32,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:32,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:32,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:32,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:32,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:32,557 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 177 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:32,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:32,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:32,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:32,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:32,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:32,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:32,591 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:32,862 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:32,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:32,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:32,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:32,863 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:32,863 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:32,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:32,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:33:32,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:32,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:32,994 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:32,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:32,995 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:32,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:32,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:32,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:32,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:32,995 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:32,995 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:32,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash -52050949, now seen corresponding path program 164 times [2018-10-04 12:33:32,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:32,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:32,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:32,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:32,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:33,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:33,054 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 178 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:33,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:33,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:33,069 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:33,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:33,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:33,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:33,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:33,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:33,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:33,092 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:33,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:33,327 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:33,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:33,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:33,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:33,328 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:33,328 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:33,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:33,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:33,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:33:33,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:33,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:33,461 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:33,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:33,461 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:33,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:33,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:33,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:33,461 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:33,461 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:33,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:33,461 INFO L82 PathProgramCache]: Analyzing trace with hash -52049027, now seen corresponding path program 165 times [2018-10-04 12:33:33,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:33,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:33,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:33,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:33,523 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:33,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:33,538 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:33,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:33,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:33,542 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:33,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:33,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:33,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:33,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:33,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:33,562 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:33,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:33,794 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:33,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:33,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:33,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:33,795 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:33,795 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:33,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:33,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2018-10-04 12:33:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:33,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:33,967 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:33,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:33,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:33,967 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:33,967 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:33,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1721109371, now seen corresponding path program 166 times [2018-10-04 12:33:33,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:33,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:33,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:34,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:34,061 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 180 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:34,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:34,075 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:34,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:34,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:34,077 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:34,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:34,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:34,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:34,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:34,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:34,097 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:34,373 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:34,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:34,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:34,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:34,374 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:34,374 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:34,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:34,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:34,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:33:34,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:34,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:34,505 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:34,505 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:34,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:34,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:34,506 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:34,506 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:34,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:34,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1721111293, now seen corresponding path program 167 times [2018-10-04 12:33:34,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:34,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:34,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:34,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:34,569 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:34,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:34,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 181 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:34,586 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:34,586 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:34,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:34,589 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:34,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:34,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:34,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:34,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:34,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:34,610 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:34,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:34,870 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:33:34,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:34,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:34,871 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:33:34,871 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:33:34,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:34,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:33:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:33:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:35,007 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:35,007 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:35,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:35,007 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:35,007 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:35,007 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:35,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1722956413, now seen corresponding path program 168 times [2018-10-04 12:33:35,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:35,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:35,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:35,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 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 182 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:35,076 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:35,085 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:35,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:35,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:35,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:35,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:35,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:35,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:35,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:35,109 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:35,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:35,375 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:33:35,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:35,376 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:35,376 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:33:35,376 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:33:35,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:35,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:33:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:33:35,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:35,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:35,516 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:35,516 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:35,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:35,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:35,517 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:35,517 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:35,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1722958335, now seen corresponding path program 169 times [2018-10-04 12:33:35,517 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:35,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:35,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:35,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:35,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:35,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:35,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:35,581 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 183 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:35,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:35,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:35,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:35,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:35,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:35,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:35,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:35,618 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:35,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:35,851 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:35,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:35,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:35,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:35,852 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:35,852 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:35,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:35,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2018-10-04 12:33:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:35,959 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:33:35,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:35,959 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:35,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:35,960 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:35,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:35,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:35,960 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:35,960 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:35,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:35,960 INFO L82 PathProgramCache]: Analyzing trace with hash 626160379, now seen corresponding path program 170 times [2018-10-04 12:33:35,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:35,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:35,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:36,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:36,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 184 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:36,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:36,033 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:36,033 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:36,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:36,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:36,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:36,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:36,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:36,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:36,057 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:33:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:36,288 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:36,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:36,289 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:36,289 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:36,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:36,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:33:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:36,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:36,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:36,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:36,433 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:36,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:36,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:36,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:36,434 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:36,434 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:36,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:36,434 INFO L82 PathProgramCache]: Analyzing trace with hash 626162301, now seen corresponding path program 171 times [2018-10-04 12:33:36,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:36,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:36,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:36,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:36,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:36,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:36,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:36,497 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 185 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:36,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:36,513 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:36,513 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:36,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:36,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:36,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:36,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:36,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:36,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:36,537 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:36,755 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:36,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:36,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:36,756 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:36,756 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:36,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-10-04 12:33:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:36,890 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:36,890 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:36,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:36,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:36,890 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:36,890 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:36,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash 628007421, now seen corresponding path program 172 times [2018-10-04 12:33:36,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:36,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:36,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:36,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:36,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:36,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:36,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:36,966 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:36,967 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:36,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:36,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:36,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:36,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:36,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:36,990 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:37,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:37,227 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:33:37,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:37,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:37,228 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:33:37,228 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:33:37,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:33:37,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:33:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:37,372 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:37,372 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:37,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:37,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:37,373 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:37,373 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:37,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:37,373 INFO L82 PathProgramCache]: Analyzing trace with hash 628009343, now seen corresponding path program 173 times [2018-10-04 12:33:37,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:37,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:37,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:37,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:37,672 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:37,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:37,672 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:37,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:37,691 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:37,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:37,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:37,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:37,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:37,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:37,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:37,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:37,714 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:37,935 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:33:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:37,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:37,936 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:33:37,936 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:33:37,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:37,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:33:38,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2018-10-04 12:33:38,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:38,068 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:38,068 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:38,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:38,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:38,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:38,068 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:38,069 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:38,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:38,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1893799555, now seen corresponding path program 174 times [2018-10-04 12:33:38,069 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:38,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:38,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:38,143 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:38,154 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:38,182 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:38,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:38,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:38,185 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:38,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:38,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:38,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:38,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:38,207 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:38,441 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:33:38,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:38,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:38,442 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:33:38,442 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:33:38,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:33:38,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-10-04 12:33:38,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:38,580 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:38,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:38,580 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:38,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:38,580 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:38,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:38,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:38,581 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:38,581 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:38,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:38,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1893797633, now seen corresponding path program 175 times [2018-10-04 12:33:38,581 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:38,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:38,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:38,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:38,640 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:38,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:38,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:38,657 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:38,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:38,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:38,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:38,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:38,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:38,682 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:38,909 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:33:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:38,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:38,910 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:33:38,910 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:33:38,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:33:39,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-10-04 12:33:39,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:39,055 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:39,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:39,055 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:39,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:39,055 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:39,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:39,056 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:39,056 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:39,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:39,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1891952513, now seen corresponding path program 176 times [2018-10-04 12:33:39,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:39,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:39,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:39,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:39,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 190 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:39,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:39,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:39,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:39,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:39,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:39,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:39,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:39,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:39,171 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:39,404 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-10-04 12:33:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:39,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:39,405 INFO L225 Difference]: With dead ends: 35 [2018-10-04 12:33:39,405 INFO L226 Difference]: Without dead ends: 33 [2018-10-04 12:33:39,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-04 12:33:39,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-04 12:33:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:39,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:39,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:39,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:39,553 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:39,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:39,553 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:39,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:39,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:39,553 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:39,554 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:39,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:39,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1891950591, now seen corresponding path program 177 times [2018-10-04 12:33:39,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:39,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:39,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:39,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:39,630 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 191 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:39,638 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:39,646 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:39,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:39,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:39,649 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:39,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:39,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:39,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:39,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:39,669 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:39,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:39,866 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2018-10-04 12:33:39,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:39,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:39,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:39,867 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:33:39,867 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:33:39,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:39,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:33:39,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 20. [2018-10-04 12:33:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:33:39,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:33:39,956 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 12:33:39,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:39,956 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:33:39,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:39,956 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:33:39,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:39,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:39,956 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:33:39,956 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:39,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:39,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1448020233, now seen corresponding path program 178 times [2018-10-04 12:33:39,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:39,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:39,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:39,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:40,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 192 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:40,218 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:40,225 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:40,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:40,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:40,229 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:40,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:40,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:40,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:40,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:40,257 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 10 states. [2018-10-04 12:33:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:40,633 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:40,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:40,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:40,634 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:40,634 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:40,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:40,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:40,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:33:40,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:40,801 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:40,801 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:40,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:40,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:40,802 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:40,802 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:40,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1448018311, now seen corresponding path program 179 times [2018-10-04 12:33:40,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:40,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:40,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:40,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:40,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:40,866 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 193 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:40,876 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:40,885 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:40,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:40,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:40,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:40,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:40,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:40,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:40,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:40,910 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:41,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:41,315 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:41,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:41,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:41,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:41,316 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:41,316 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:41,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:41,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:33:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:41,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:41,481 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:41,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:41,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:41,481 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:41,481 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:41,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1446173191, now seen corresponding path program 180 times [2018-10-04 12:33:41,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:41,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:41,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:41,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:41,542 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 194 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:41,550 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:41,557 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:41,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:41,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:41,561 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:41,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:41,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:41,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:41,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:41,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:41,588 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:41,959 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:33:41,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:41,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:41,960 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:33:41,960 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:33:41,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:33:42,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:33:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:42,156 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:42,157 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:42,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:42,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:42,157 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:42,157 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:42,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:42,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1446171269, now seen corresponding path program 181 times [2018-10-04 12:33:42,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:42,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:42,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:42,225 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:42,226 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 195 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:42,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:42,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:42,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:42,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:42,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:42,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:42,262 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:42,627 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:42,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:42,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:42,633 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:42,634 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:42,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:42,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:33:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 12:33:42,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:42,780 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:42,781 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:42,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:42,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:42,781 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:42,781 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:42,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:42,782 INFO L82 PathProgramCache]: Analyzing trace with hash 326987129, now seen corresponding path program 182 times [2018-10-04 12:33:42,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:42,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:42,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:42,889 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 196 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:42,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:42,905 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:42,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:42,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:42,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:42,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:42,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:42,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:42,929 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:43,338 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:43,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:43,339 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:43,339 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:43,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:33:43,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:43,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:43,512 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:43,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:43,512 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:43,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:43,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:43,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:43,513 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:43,513 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:43,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:43,513 INFO L82 PathProgramCache]: Analyzing trace with hash 326989051, now seen corresponding path program 183 times [2018-10-04 12:33:43,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:43,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:43,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:43,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:43,577 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:43,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:43,578 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 197 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:43,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:43,592 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:43,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:43,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:43,596 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:43,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:43,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:43,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:43,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:43,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:43,616 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:44,006 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:44,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:44,006 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:44,007 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:44,007 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:44,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:44,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:33:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:44,182 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:44,182 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:44,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:44,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:44,183 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:44,183 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:44,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:44,183 INFO L82 PathProgramCache]: Analyzing trace with hash 328834171, now seen corresponding path program 184 times [2018-10-04 12:33:44,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:44,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:44,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:44,244 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:44,244 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 198 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:44,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:44,258 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:44,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:44,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:44,260 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:44,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:44,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:44,284 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:44,658 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:33:44,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:44,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:44,659 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:33:44,659 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:33:44,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:33:44,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:33:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:44,839 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:44,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:44,839 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:44,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:44,839 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:44,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:44,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:44,839 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:44,839 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:44,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:44,840 INFO L82 PathProgramCache]: Analyzing trace with hash 328836093, now seen corresponding path program 185 times [2018-10-04 12:33:44,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:44,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:44,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:44,909 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 199 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:44,917 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:44,925 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:44,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:44,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:44,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:44,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:44,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:44,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:44,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:44,949 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:45,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:45,318 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:45,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:45,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:45,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:45,319 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:45,319 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:45,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:33:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 12:33:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:45,469 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:45,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:45,469 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:45,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:45,469 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:45,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:45,469 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:45,469 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:45,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:45,470 INFO L82 PathProgramCache]: Analyzing trace with hash -767961863, now seen corresponding path program 186 times [2018-10-04 12:33:45,470 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:45,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:45,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:45,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:46,452 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:46,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:46,452 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 200 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:46,471 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:46,569 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:46,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:46,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:46,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:46,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:46,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:46,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:46,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:46,605 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:47,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:47,107 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:47,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:47,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:47,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:47,108 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:47,108 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:47,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:33:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:33:47,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:47,294 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:47,294 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:47,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:47,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:47,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:47,295 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:47,295 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:47,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:47,295 INFO L82 PathProgramCache]: Analyzing trace with hash -767959941, now seen corresponding path program 187 times [2018-10-04 12:33:47,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:47,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:47,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:47,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:47,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:47,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:47,360 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 201 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:47,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:47,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:47,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:47,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:47,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:47,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:47,398 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:47,793 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:33:47,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:47,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:47,794 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:33:47,794 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:33:47,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:47,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:33:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:33:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:47,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:47,957 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:47,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:47,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:47,957 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:47,957 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:47,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -766114821, now seen corresponding path program 188 times [2018-10-04 12:33:47,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:47,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:47,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:47,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:47,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:48,008 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:48,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:48,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 202 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:48,017 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:48,022 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:48,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:48,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:48,026 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:48,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:48,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:48,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:48,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:48,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:48,046 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:48,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:48,540 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:48,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:48,540 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:48,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:48,541 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:48,541 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:48,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:33:48,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:33:48,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:48,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:48,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:48,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:48,726 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:48,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:48,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:48,727 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:48,727 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:48,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:48,727 INFO L82 PathProgramCache]: Analyzing trace with hash -766112899, now seen corresponding path program 189 times [2018-10-04 12:33:48,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:48,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:48,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:48,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:48,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:48,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:48,789 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 203 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:48,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:48,805 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:48,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:48,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:48,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:48,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:48,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:48,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:48,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:48,829 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:49,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:49,202 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:33:49,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:49,203 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:49,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:49,203 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:33:49,203 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:33:49,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:49,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:33:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 12:33:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:49,360 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:49,360 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:49,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:49,360 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:49,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:49,361 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:49,361 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:49,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:49,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1007045499, now seen corresponding path program 190 times [2018-10-04 12:33:49,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:49,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:49,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:49,425 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:49,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:49,425 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 204 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:49,433 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:49,438 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:49,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:49,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:49,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:49,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:49,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:49,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:49,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:49,473 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:49,952 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:49,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:49,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:49,953 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:49,953 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:49,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:49,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:33:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:50,122 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:50,123 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:50,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:50,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:50,123 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:50,123 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:50,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:50,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1007047421, now seen corresponding path program 191 times [2018-10-04 12:33:50,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:50,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:50,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:50,185 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 205 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:50,195 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:50,205 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:50,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:50,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:50,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:50,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:50,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:50,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:50,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:50,229 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:50,585 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:33:50,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:50,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:50,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:50,586 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:33:50,586 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:33:50,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:33:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:33:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:50,752 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:50,752 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:50,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:50,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:50,752 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:50,753 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:50,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:50,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1008892541, now seen corresponding path program 192 times [2018-10-04 12:33:50,753 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:50,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:50,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:50,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:50,916 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:50,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:50,916 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 206 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:50,924 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:50,933 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:50,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:50,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:50,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:50,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:50,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:50,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:50,957 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:51,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:51,279 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:33:51,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:51,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:51,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:51,280 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:33:51,280 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:33:51,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:51,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:33:51,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:33:51,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:51,489 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:51,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:51,489 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:51,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:51,489 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:51,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:51,489 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:51,489 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:51,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1008894463, now seen corresponding path program 193 times [2018-10-04 12:33:51,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:51,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:51,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:51,556 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:51,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:51,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:51,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:51,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:51,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:51,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:51,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:51,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:51,597 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:51,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:51,932 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:33:51,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:51,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:51,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:51,933 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:33:51,933 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:33:51,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:33:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 24. [2018-10-04 12:33:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:33:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:33:52,066 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:33:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:52,066 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:33:52,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:33:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:52,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:52,066 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:52,066 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:52,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:52,067 INFO L82 PathProgramCache]: Analyzing trace with hash -746955655, now seen corresponding path program 194 times [2018-10-04 12:33:52,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:52,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:52,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:52,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:52,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 208 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:52,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:52,137 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:52,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:52,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:52,141 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:52,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:52,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:52,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:52,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:52,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:52,161 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:33:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:52,585 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:52,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:52,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:52,586 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:52,586 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:52,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:52,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:33:52,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:52,772 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:52,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:52,772 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:52,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:52,773 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:52,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:52,773 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:52,773 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:52,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:52,773 INFO L82 PathProgramCache]: Analyzing trace with hash -746953733, now seen corresponding path program 195 times [2018-10-04 12:33:52,773 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:52,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:52,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:52,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:52,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 209 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:52,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:52,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:52,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:52,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:52,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:52,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:52,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:52,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:52,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:52,964 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:53,392 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:53,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:53,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:53,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:53,393 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:53,393 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:53,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:53,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:33:53,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:53,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:53,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:53,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:53,574 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:53,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:53,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:53,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:53,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:53,574 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:53,574 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:53,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:53,575 INFO L82 PathProgramCache]: Analyzing trace with hash -745108613, now seen corresponding path program 196 times [2018-10-04 12:33:53,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:53,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:53,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:53,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:53,645 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:53,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:53,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 210 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:53,653 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:53,664 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:53,664 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:53,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:53,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:53,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:53,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:53,687 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:54,098 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:33:54,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:54,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:54,099 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:33:54,099 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:33:54,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:33:54,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:33:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:54,284 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:54,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:54,284 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:54,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:54,284 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:54,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:54,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:54,285 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:54,285 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:54,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -745106691, now seen corresponding path program 197 times [2018-10-04 12:33:54,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:54,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,286 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:54,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:54,343 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:54,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:54,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 211 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:54,351 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:54,362 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:54,362 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:54,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:54,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:54,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:54,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:54,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:54,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:54,388 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:54,790 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:54,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:54,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:54,791 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:54,791 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:54,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:33:54,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2018-10-04 12:33:54,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:33:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:33:54,956 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:33:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:54,956 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:33:54,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:33:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:54,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:54,957 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:54,957 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:54,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:54,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1028051707, now seen corresponding path program 198 times [2018-10-04 12:33:54,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:54,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:54,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:55,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:55,023 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 212 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:55,031 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:55,040 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:55,040 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:55,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:55,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:55,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:55,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:55,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:55,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:55,064 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:33:55,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:55,479 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:55,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:55,480 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:55,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:55,480 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:55,480 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:55,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:55,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 32. [2018-10-04 12:33:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:55,674 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:55,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:55,674 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:55,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:55,674 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:55,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:55,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:55,675 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:55,675 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:55,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1028053629, now seen corresponding path program 199 times [2018-10-04 12:33:55,675 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:55,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:55,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:55,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:55,735 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:55,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:55,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 213 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:55,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:55,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:55,751 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:55,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:55,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:55,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:55,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:55,772 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:56,212 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:33:56,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:56,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:56,213 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:33:56,213 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:33:56,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:56,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:33:56,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 30. [2018-10-04 12:33:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:56,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:56,387 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:56,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:56,387 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:56,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:56,387 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:56,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:56,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:56,387 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:56,388 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:56,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:56,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1029898749, now seen corresponding path program 200 times [2018-10-04 12:33:56,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:56,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:56,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:33:56,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:56,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:56,447 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 214 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:56,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:33:56,459 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:33:56,459 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:56,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:56,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:56,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:56,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:56,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:56,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:56,483 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:56,899 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:33:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:56,900 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:56,900 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:33:56,900 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:33:56,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:33:57,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 32. [2018-10-04 12:33:57,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:57,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:57,085 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:57,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:57,085 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:57,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:57,086 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:57,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:57,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:57,086 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:33:57,086 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:57,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:57,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1029900671, now seen corresponding path program 201 times [2018-10-04 12:33:57,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:57,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:57,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:57,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:57,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:57,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 215 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:33:57,161 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:33:57,161 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:57,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:57,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:57,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:57,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:57,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:57,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:57,184 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:57,580 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:57,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:57,581 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:57,581 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:57,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:33:57,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 26. [2018-10-04 12:33:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:33:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:33:57,738 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:33:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:57,738 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:33:57,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:33:57,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:57,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:57,738 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:57,738 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:57,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:57,739 INFO L82 PathProgramCache]: Analyzing trace with hash -66897285, now seen corresponding path program 202 times [2018-10-04 12:33:57,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:57,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:57,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:57,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:57,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 216 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:57,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:33:57,844 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:33:57,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:57,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:57,847 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:57,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:57,867 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:33:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:58,265 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:58,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:58,266 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:58,266 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:58,266 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:58,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:58,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:33:58,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:33:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:33:58,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:33:58,450 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:33:58,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:58,451 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:33:58,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:33:58,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:58,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:58,451 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:58,451 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:58,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:58,451 INFO L82 PathProgramCache]: Analyzing trace with hash -66895363, now seen corresponding path program 203 times [2018-10-04 12:33:58,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:58,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:58,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:58,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:58,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:58,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:58,512 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 217 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:58,520 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:33:58,529 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:33:58,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:58,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:58,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:58,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:58,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:58,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:58,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:58,554 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:33:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:58,953 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:33:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:58,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:58,954 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:33:58,954 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:33:58,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:58,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:33:59,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:33:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:33:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:33:59,150 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:33:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:33:59,151 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:33:59,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:33:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:33:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:33:59,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:33:59,151 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:33:59,151 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:33:59,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:33:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash -65050243, now seen corresponding path program 204 times [2018-10-04 12:33:59,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:33:59,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:33:59,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:33:59,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:33:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:33:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:59,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:33:59,378 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 218 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:33:59,386 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:33:59,394 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:33:59,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:33:59,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:33:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:33:59,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:33:59,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:33:59,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:33:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:33:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:59,419 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:33:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:33:59,820 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:33:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:33:59,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:33:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:33:59,821 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:33:59,821 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:33:59,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:33:59,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:34:00,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:34:00,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:00,007 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:00,007 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:00,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:00,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:00,008 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:00,008 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:00,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:00,008 INFO L82 PathProgramCache]: Analyzing trace with hash -65048321, now seen corresponding path program 205 times [2018-10-04 12:34:00,008 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:00,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:00,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:00,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:00,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:00,070 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 219 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:00,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:00,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:00,090 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:00,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:00,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:00,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:00,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:00,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:00,110 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:00,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:00,502 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:00,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:00,503 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:00,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:00,503 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:00,503 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:00,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:00,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:00,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2018-10-04 12:34:00,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:34:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:34:00,680 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:34:00,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:00,681 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:34:00,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:00,681 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:34:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:00,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:00,681 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:00,681 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:00,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1708110077, now seen corresponding path program 206 times [2018-10-04 12:34:00,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:00,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:00,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:00,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:00,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:00,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:00,752 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 220 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:00,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:00,767 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:00,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:00,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:00,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:00,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:00,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:00,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:00,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:00,790 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:34:01,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:01,161 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:01,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:01,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:01,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:01,162 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:01,162 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:01,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:01,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:01,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:34:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:01,362 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:01,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:01,362 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:01,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:01,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:01,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:01,362 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:01,363 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:01,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:01,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1708111999, now seen corresponding path program 207 times [2018-10-04 12:34:01,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:01,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:01,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:01,448 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 221 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:01,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:01,466 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:34:01,466 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:01,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:01,470 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:01,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:01,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:01,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:01,492 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:01,870 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:01,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:01,871 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:01,871 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:01,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:01,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:02,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:34:02,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:02,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:02,055 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:02,055 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:02,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:02,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:02,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:02,056 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:02,056 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:02,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:02,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1709957119, now seen corresponding path program 208 times [2018-10-04 12:34:02,056 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:02,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:02,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:02,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:02,140 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:02,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:02,141 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 222 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:02,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:02,153 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:02,154 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:02,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:02,157 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:02,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:02,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:02,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:02,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:02,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:02,178 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:02,535 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:34:02,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:02,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:02,536 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:34:02,536 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:34:02,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:34:02,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:34:02,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:02,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:02,724 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:02,724 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:02,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:02,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:02,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:02,724 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:34:02,724 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:02,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:02,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1709959041, now seen corresponding path program 209 times [2018-10-04 12:34:02,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:02,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:02,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:02,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:02,788 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 223 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:02,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:02,805 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:34:02,805 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:02,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:02,809 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:02,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:02,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:02,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:02,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:02,831 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,167 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:34:03,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:03,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,168 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:34:03,168 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:03,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:03,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 22. [2018-10-04 12:34:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:34:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:34:03,288 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 17 [2018-10-04 12:34:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:03,288 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:34:03,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:34:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:03,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,289 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:03,289 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:03,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,289 INFO L82 PathProgramCache]: Analyzing trace with hash -2034826247, now seen corresponding path program 210 times [2018-10-04 12:34:03,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:03,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:03,375 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:03,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:03,376 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 224 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:03,383 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:03,392 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:34:03,392 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:03,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:03,396 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:03,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:03,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:03,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:03,417 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 10 states. [2018-10-04 12:34:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,827 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:03,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:03,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,828 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:03,828 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:03,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:03,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:04,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:34:04,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:04,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:04,032 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:04,033 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:04,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:04,033 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:04,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:04,033 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:04,033 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:04,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:04,034 INFO L82 PathProgramCache]: Analyzing trace with hash -2034824325, now seen corresponding path program 211 times [2018-10-04 12:34:04,034 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:04,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:04,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:04,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,099 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:04,100 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 225 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:04,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:04,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:04,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:04,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:04,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:04,137 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:04,547 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:04,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:04,548 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:04,548 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:04,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:34:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:04,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:04,766 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:04,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:04,766 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:04,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:04,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:04,767 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:04,767 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:04,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:04,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2032979205, now seen corresponding path program 212 times [2018-10-04 12:34:04,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:04,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:04,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:04,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:04,828 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 226 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:04,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:04,840 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:04,840 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:04,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:04,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:04,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:04,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:04,862 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:05,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:05,289 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:05,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:05,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:05,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:05,290 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:05,290 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:05,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:05,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:34:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:05,512 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:05,512 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:05,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:05,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:05,512 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:05,512 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:05,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash -2032977283, now seen corresponding path program 213 times [2018-10-04 12:34:05,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:05,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:05,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:05,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:05,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:05,587 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 227 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:05,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:05,607 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:34:05,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:05,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:05,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:05,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:05,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:05,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:05,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:05,639 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:06,041 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:06,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:06,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:06,043 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:06,043 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:06,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 12:34:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:34:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:34:06,229 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:34:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:06,230 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:34:06,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:34:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:06,230 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:06,230 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:06,230 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:06,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:06,230 INFO L82 PathProgramCache]: Analyzing trace with hash -259818885, now seen corresponding path program 214 times [2018-10-04 12:34:06,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:06,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:06,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:06,296 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:06,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:06,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 228 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:06,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:06,313 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:06,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:06,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:06,318 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:06,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:06,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:06,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:06,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:06,349 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:34:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:06,785 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:34:06,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:06,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:06,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:06,786 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:34:06,786 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:34:06,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:06,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:34:07,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:34:07,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:07,003 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:07,003 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:07,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:07,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:07,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:07,004 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:07,004 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:07,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:07,004 INFO L82 PathProgramCache]: Analyzing trace with hash -259816963, now seen corresponding path program 215 times [2018-10-04 12:34:07,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:07,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:07,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:07,067 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 229 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:07,075 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:07,082 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:34:07,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:07,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:07,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:07,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:07,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:07,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:07,106 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:07,506 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:34:07,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:07,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:07,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:07,507 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:34:07,507 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:34:07,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:34:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 12:34:07,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:07,705 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:07,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:07,705 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:07,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:07,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:07,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:07,705 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:07,706 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:07,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:07,706 INFO L82 PathProgramCache]: Analyzing trace with hash -257971843, now seen corresponding path program 216 times [2018-10-04 12:34:07,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:07,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:07,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:07,768 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:07,769 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 230 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:07,776 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:07,786 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:34:07,786 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:07,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:07,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:07,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:07,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:07,811 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:08,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:08,183 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:34:08,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:08,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:08,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:08,184 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:34:08,184 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:08,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:08,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:34:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:08,400 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:08,400 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:08,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:08,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:08,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:08,401 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:08,401 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:08,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash -257969921, now seen corresponding path program 217 times [2018-10-04 12:34:08,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:08,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:08,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:08,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:08,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:08,478 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 231 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:08,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:08,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:08,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:08,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:08,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:08,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:08,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:08,514 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:08,875 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:34:08,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:08,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:08,876 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:34:08,876 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:34:08,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:08,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:34:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 26. [2018-10-04 12:34:09,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:34:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:34:09,044 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:34:09,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:09,044 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:34:09,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:09,044 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:34:09,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:09,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:09,045 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:09,045 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:09,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:09,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1354767877, now seen corresponding path program 218 times [2018-10-04 12:34:09,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:09,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:09,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:09,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:09,106 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:09,106 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 232 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:09,115 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:09,121 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:09,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:09,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:09,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:09,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:09,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:09,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:09,144 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:34:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:09,615 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:09,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:09,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:09,616 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:09,616 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:09,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:09,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:34:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:09,857 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:09,858 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:09,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:09,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:09,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:09,858 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:09,858 INFO L423 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:09,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:09,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1354765955, now seen corresponding path program 219 times [2018-10-04 12:34:09,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:09,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:09,928 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:09,928 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 233 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:09,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:34:09,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:09,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:09,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:09,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:09,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:09,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:09,980 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:11,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:11,003 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:11,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:11,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:11,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:11,004 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:11,004 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:11,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:11,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 30. [2018-10-04 12:34:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:11,368 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:11,368 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:11,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:11,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:11,369 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:11,369 INFO L423 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:11,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1352920835, now seen corresponding path program 220 times [2018-10-04 12:34:11,369 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:11,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:11,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:11,496 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:11,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:11,497 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 234 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:11,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:11,510 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:11,510 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:11,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:11,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:11,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:11,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:11,534 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:11,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:11,955 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:11,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:11,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:11,956 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:11,956 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:11,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:12,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:34:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:12,163 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:12,164 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:12,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:12,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:12,164 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:12,164 INFO L423 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:12,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:12,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1352918913, now seen corresponding path program 221 times [2018-10-04 12:34:12,165 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:12,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:12,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:12,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:12,229 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:12,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:12,229 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 235 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:12,237 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:12,247 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:34:12,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:12,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:12,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:12,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:12,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:12,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:12,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:12,271 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:12,680 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:12,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:12,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:12,681 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:12,681 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:12,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:12,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:12,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 28. [2018-10-04 12:34:12,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:34:12,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:34:12,867 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:34:12,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:12,867 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:34:12,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:12,867 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:34:12,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:12,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:12,867 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:12,867 INFO L423 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:12,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:12,868 INFO L82 PathProgramCache]: Analyzing trace with hash 420239485, now seen corresponding path program 222 times [2018-10-04 12:34:12,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:12,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:12,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:12,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:12,951 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 236 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:12,959 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:12,966 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:34:12,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:12,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:12,970 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:12,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:12,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:12,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:12,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:12,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:12,990 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:34:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:13,392 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:34:13,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:13,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:13,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:13,393 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:34:13,393 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:34:13,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:34:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:34:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:13,605 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:13,605 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:13,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:13,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:13,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:13,606 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:13,606 INFO L423 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:13,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:13,606 INFO L82 PathProgramCache]: Analyzing trace with hash 420241407, now seen corresponding path program 223 times [2018-10-04 12:34:13,606 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:13,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:13,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:13,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:14,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:14,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-04 12:34:14,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 237 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:14,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:14,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:14,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:14,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:14,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:14,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:14,693 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:15,167 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:34:15,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:15,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:15,168 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:34:15,168 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:34:15,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:34:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 30. [2018-10-04 12:34:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:15,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:15,373 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:15,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:15,373 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:15,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:15,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:15,374 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:15,374 INFO L423 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:15,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:15,374 INFO L82 PathProgramCache]: Analyzing trace with hash 422086527, now seen corresponding path program 224 times [2018-10-04 12:34:15,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:15,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:15,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:15,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:15,433 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 238 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:15,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:15,447 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:15,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:15,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:15,451 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:15,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:15,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:15,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:15,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:15,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:15,472 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:15,853 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:34:15,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:15,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:15,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:15,854 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:34:15,854 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:15,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:16,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:34:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:16,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:16,069 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:16,069 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:16,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:16,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:16,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:16,070 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:34:16,070 INFO L423 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:16,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:16,070 INFO L82 PathProgramCache]: Analyzing trace with hash 422088449, now seen corresponding path program 225 times [2018-10-04 12:34:16,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:16,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:16,133 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:16,133 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 239 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:16,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:16,149 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:34:16,149 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:16,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:16,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:16,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:16,173 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:16,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:16,541 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:34:16,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:16,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:16,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:16,542 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:34:16,542 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:34:16,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:16,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:34:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 24. [2018-10-04 12:34:16,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:34:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:34:16,709 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 17 [2018-10-04 12:34:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:16,709 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:34:16,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:34:16,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:16,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:16,709 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:16,710 INFO L423 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:16,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:16,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1333761669, now seen corresponding path program 226 times [2018-10-04 12:34:16,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:16,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:16,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:16,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:16,769 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 240 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:16,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:16,782 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:16,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:16,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:16,785 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:16,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:16,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:16,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:16,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:16,805 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 10 states. [2018-10-04 12:34:17,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:17,177 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:34:17,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:17,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:17,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:17,178 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:34:17,178 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:17,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:17,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:34:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:17,416 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:17,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:17,416 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:17,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:17,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:17,417 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:17,417 INFO L423 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:17,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:17,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1333759747, now seen corresponding path program 227 times [2018-10-04 12:34:17,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:17,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:17,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:17,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:17,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:17,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 241 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:17,488 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:17,497 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:34:17,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:17,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:17,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:17,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:17,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:17,522 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:17,910 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:34:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:17,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:17,911 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:34:17,911 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:17,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:17,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:34:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:18,119 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:18,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:18,119 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:18,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:18,119 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:18,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:18,120 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:18,120 INFO L423 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:18,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1331914627, now seen corresponding path program 228 times [2018-10-04 12:34:18,120 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:18,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:18,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:18,180 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 242 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:18,187 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:18,197 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:34:18,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:18,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:18,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:18,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:18,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:18,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:18,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:18,220 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:18,568 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:34:18,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:18,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:18,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:18,568 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:34:18,568 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:34:18,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:34:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 12:34:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:18,807 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:18,807 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:18,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:18,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:18,807 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:18,807 INFO L423 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:18,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1331912705, now seen corresponding path program 229 times [2018-10-04 12:34:18,808 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:18,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:18,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:18,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:18,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:18,869 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 243 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:18,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:18,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:18,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:18,884 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:18,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:18,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:18,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:18,904 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:19,284 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:34:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:19,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:19,285 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:34:19,285 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:34:19,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:34:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2018-10-04 12:34:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:34:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:34:19,482 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:34:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:19,482 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:34:19,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:34:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:19,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:19,482 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:19,483 INFO L423 AbstractCegarLoop]: === Iteration 244 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:19,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:19,483 INFO L82 PathProgramCache]: Analyzing trace with hash 441245693, now seen corresponding path program 230 times [2018-10-04 12:34:19,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:19,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:19,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:19,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:19,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 244 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:19,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:19,557 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:19,557 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:19,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:19,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:19,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:19,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:19,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:19,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:19,581 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:34:19,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:19,964 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:34:19,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:19,964 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:19,965 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:34:19,965 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:19,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:20,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 32. [2018-10-04 12:34:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:20,183 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:20,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:20,183 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:20,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:20,184 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:20,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:20,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:20,184 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:20,184 INFO L423 AbstractCegarLoop]: === Iteration 245 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:20,184 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash 441247615, now seen corresponding path program 231 times [2018-10-04 12:34:20,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:20,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:20,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:20,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:20,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:20,250 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 245 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:20,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:20,280 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:34:20,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:20,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:20,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:20,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:20,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:20,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:20,314 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:20,794 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:34:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:20,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:20,795 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:34:20,795 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:20,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:20,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2018-10-04 12:34:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:21,025 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:21,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:21,025 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:21,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:21,025 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:21,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:21,025 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:21,025 INFO L423 AbstractCegarLoop]: === Iteration 246 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:21,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:21,026 INFO L82 PathProgramCache]: Analyzing trace with hash 443092735, now seen corresponding path program 232 times [2018-10-04 12:34:21,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:21,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:21,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:21,087 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:21,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:21,087 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 246 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:21,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:21,103 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:21,103 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:21,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:21,107 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:21,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:21,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:21,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:21,127 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:21,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:21,504 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:34:21,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:21,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:21,505 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:34:21,505 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:34:21,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:21,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:34:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2018-10-04 12:34:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:21,723 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:21,723 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:21,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:21,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:21,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:21,723 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:34:21,723 INFO L423 AbstractCegarLoop]: === Iteration 247 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:21,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:21,724 INFO L82 PathProgramCache]: Analyzing trace with hash 443094657, now seen corresponding path program 233 times [2018-10-04 12:34:21,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:21,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:21,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:21,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:21,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:21,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:21,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 247 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:21,792 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:21,800 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:34:21,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:21,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:21,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:21,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:21,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:21,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:21,825 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:22,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:22,183 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:34:22,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:22,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:22,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:22,184 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:34:22,184 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:34:22,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:34:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2018-10-04 12:34:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:34:22,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:34:22,361 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 17 [2018-10-04 12:34:22,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:22,361 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:34:22,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:22,361 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:34:22,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:22,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:22,361 INFO L375 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-10-04 12:34:22,361 INFO L423 AbstractCegarLoop]: === Iteration 248 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:22,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:22,362 INFO L82 PathProgramCache]: Analyzing trace with hash -653703299, now seen corresponding path program 234 times [2018-10-04 12:34:22,362 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:22,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:22,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:22,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:22,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:22,422 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 248 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:22,430 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:22,437 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:34:22,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:22,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:22,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:22,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:22,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:22,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:22,462 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 10 states. [2018-10-04 12:34:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:22,829 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:34:22,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:22,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:22,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:22,830 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:34:22,830 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:34:22,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:34:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 12:34:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:23,069 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:23,069 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:23,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:23,069 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:23,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:23,069 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:23,070 INFO L423 AbstractCegarLoop]: === Iteration 249 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:23,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:23,070 INFO L82 PathProgramCache]: Analyzing trace with hash -653701377, now seen corresponding path program 235 times [2018-10-04 12:34:23,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:23,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:23,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:23,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:23,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:23,130 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 249 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:23,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:23,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:23,146 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:23,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:23,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:23,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:23,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:23,166 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:23,512 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:34:23,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:23,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:23,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:23,513 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:34:23,513 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:34:23,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:23,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:34:23,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-10-04 12:34:23,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:23,731 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:23,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:23,731 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:23,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:23,731 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:23,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:23,731 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:23,731 INFO L423 AbstractCegarLoop]: === Iteration 250 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:23,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:23,731 INFO L82 PathProgramCache]: Analyzing trace with hash -651856257, now seen corresponding path program 236 times [2018-10-04 12:34:23,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:23,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:23,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:23,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:23,830 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 250 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:23,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:23,844 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:23,844 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:23,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:23,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:23,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:23,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:23,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:23,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:23,879 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:24,270 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:34:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:24,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:24,271 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:34:24,271 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:34:24,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:24,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:34:24,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 12:34:24,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:24,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:24,490 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:24,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:24,490 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:24,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:24,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:24,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:24,490 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:34:24,490 INFO L423 AbstractCegarLoop]: === Iteration 251 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:24,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:24,491 INFO L82 PathProgramCache]: Analyzing trace with hash -651854335, now seen corresponding path program 237 times [2018-10-04 12:34:24,491 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:24,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:24,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:24,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:24,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 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 251 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:24,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:24,576 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-04 12:34:24,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:24,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:24,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:24,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:24,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:24,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:24,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:24,600 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:24,949 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:34:24,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:24,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:24,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:24,950 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:34:24,950 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:34:24,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:24,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:34:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-10-04 12:34:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:34:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:34:25,151 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 17 [2018-10-04 12:34:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:25,151 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:34:25,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:34:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:25,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:25,151 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 12:34:25,151 INFO L423 AbstractCegarLoop]: === Iteration 252 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:25,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:25,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1121304063, now seen corresponding path program 238 times [2018-10-04 12:34:25,152 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:25,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:25,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:25,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:25,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:25,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 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 252 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:25,225 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:25,230 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:25,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:25,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:25,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:25,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:25,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:25,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:25,254 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 10 states. [2018-10-04 12:34:25,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:25,563 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:34:25,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:25,564 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:25,564 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:34:25,564 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:34:25,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:34:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-10-04 12:34:25,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:25,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:25,788 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:25,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:25,788 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:25,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:25,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:25,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:25,789 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:34:25,789 INFO L423 AbstractCegarLoop]: === Iteration 253 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:25,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1121305985, now seen corresponding path program 239 times [2018-10-04 12:34:25,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:25,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:25,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:25,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:25,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:25,859 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 253 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:25,866 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:25,874 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-10-04 12:34:25,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:25,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:25,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:25,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:25,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:25,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:25,898 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:26,222 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:34:26,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:26,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:26,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:26,223 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:34:26,223 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:34:26,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:26,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:34:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2018-10-04 12:34:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:26,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 17 [2018-10-04 12:34:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:26,444 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:26,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:26,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:26,444 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1] [2018-10-04 12:34:26,444 INFO L423 AbstractCegarLoop]: === Iteration 254 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:26,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:26,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1123151105, now seen corresponding path program 240 times [2018-10-04 12:34:26,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:26,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:26,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:26,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:26,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:26,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 254 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:26,514 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:26,523 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-10-04 12:34:26,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:26,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:26,525 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:26,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:26,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:26,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:26,545 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 10 states. [2018-10-04 12:34:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:26,876 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2018-10-04 12:34:26,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:26,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:26,877 INFO L225 Difference]: With dead ends: 37 [2018-10-04 12:34:26,877 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:34:26,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:34:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-04 12:34:27,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:27,096 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 17 [2018-10-04 12:34:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:27,097 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:27,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:27,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 12:34:27,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:27,097 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1] [2018-10-04 12:34:27,097 INFO L423 AbstractCegarLoop]: === Iteration 255 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:27,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1123153027, now seen corresponding path program 7 times [2018-10-04 12:34:27,098 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:27,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:27,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:27,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:28,089 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:28,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:28,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 255 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:28,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:28,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:28,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:28,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-04 12:34:28,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:28,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:28,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:28,150 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 10 states. [2018-10-04 12:34:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:28,429 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2018-10-04 12:34:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:28,430 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-10-04 12:34:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:28,430 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:34:28,430 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:34:28,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:34:28,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 20. [2018-10-04 12:34:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:34:28,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2018-10-04 12:34:28,572 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2018-10-04 12:34:28,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:28,572 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 28 transitions. [2018-10-04 12:34:28,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:28,573 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 28 transitions. [2018-10-04 12:34:28,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:28,573 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:28,573 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1] [2018-10-04 12:34:28,573 INFO L423 AbstractCegarLoop]: === Iteration 256 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:28,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:28,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1610002744, now seen corresponding path program 8 times [2018-10-04 12:34:28,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:28,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:28,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:28,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:28,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:28,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:28,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 256 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:28,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:28,750 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:28,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:28,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:28,753 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:28,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:28,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:28,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:28,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:28,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:28,773 INFO L87 Difference]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2018-10-04 12:34:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:29,332 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:29,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:29,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:29,334 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:29,334 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:29,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:34:29,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:29,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:29,637 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:29,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:29,637 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:29,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:29,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:29,638 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:34:29,638 INFO L423 AbstractCegarLoop]: === Iteration 257 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:29,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:29,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1610004666, now seen corresponding path program 241 times [2018-10-04 12:34:29,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:29,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:29,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:29,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:29,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:29,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:29,712 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 257 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:29,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:29,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:29,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:29,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:29,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:29,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:29,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:29,757 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:30,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:30,351 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:30,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:30,352 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:30,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:30,352 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:30,352 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:30,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:30,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:34:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:30,644 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:30,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:30,644 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:30,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:30,644 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:30,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:30,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:30,644 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:34:30,645 INFO L423 AbstractCegarLoop]: === Iteration 258 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:30,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:30,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1611849786, now seen corresponding path program 242 times [2018-10-04 12:34:30,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:30,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:30,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:30,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:30,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:30,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:30,714 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 258 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:30,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:30,762 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:30,762 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:30,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:30,765 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:30,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:30,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:30,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:30,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:30,785 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:31,374 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:34:31,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:31,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:31,375 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:34:31,375 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:34:31,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:31,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:34:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:34:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:31,643 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:31,643 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:31,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:31,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:31,644 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:31,644 INFO L423 AbstractCegarLoop]: === Iteration 259 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:31,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:31,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1611851708, now seen corresponding path program 243 times [2018-10-04 12:34:31,644 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:31,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:31,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:31,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:31,710 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:31,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:31,710 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 259 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:31,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:31,729 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:34:31,729 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:31,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:31,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:31,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:31,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:31,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:31,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:31,753 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:32,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:32,306 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:32,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:32,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:32,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:32,307 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:32,307 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:32,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 12:34:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:32,585 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:34:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:32,586 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:32,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:32,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:32,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:32,586 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:34:32,586 INFO L423 AbstractCegarLoop]: === Iteration 260 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:32,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash -909957190, now seen corresponding path program 244 times [2018-10-04 12:34:32,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:32,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:32,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:32,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:32,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:32,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 260 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:32,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:32,669 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:32,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:32,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:32,672 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:32,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:32,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:32,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:32,692 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:34:33,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:33,307 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:33,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:33,307 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:33,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:33,308 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:33,308 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:33,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:33,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:34:33,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:33,578 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:33,579 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:33,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:33,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:33,579 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:33,579 INFO L423 AbstractCegarLoop]: === Iteration 261 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:33,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash -909955268, now seen corresponding path program 245 times [2018-10-04 12:34:33,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:33,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:33,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:33,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:33,693 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:33,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:33,694 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 261 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:33,700 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:33,719 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:34:33,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:33,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:33,722 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:33,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:33,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:33,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:33,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:33,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:33,742 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:34,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:34,343 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:34,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:34,344 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:34,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:34,344 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:34,344 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:34,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:34:34,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:34,608 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:34,608 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:34,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:34,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:34,609 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:34,609 INFO L423 AbstractCegarLoop]: === Iteration 262 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:34,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash -908110148, now seen corresponding path program 246 times [2018-10-04 12:34:34,609 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:34,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:34,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:34,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:34,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:34,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:34,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 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 262 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:34,687 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:34,698 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:34:34,698 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:34,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:34,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:34,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:34,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:34,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:34,722 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:35,315 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:34:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:35,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:35,316 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:34:35,316 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:34:35,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:34:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:34:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:35,621 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:35,621 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:35,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:35,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:35,621 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:35,621 INFO L423 AbstractCegarLoop]: === Iteration 263 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:35,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash -908108226, now seen corresponding path program 247 times [2018-10-04 12:34:35,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:35,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:35,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:35,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:35,688 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 263 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:35,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:35,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:35,712 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:35,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:35,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:35,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:35,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:35,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:35,733 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:36,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:36,292 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:36,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:36,292 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:36,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:36,293 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:36,293 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:36,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:36,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 12:34:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:34:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:34:36,523 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:34:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:36,523 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:34:36,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:34:36,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:36,524 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:36,524 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:34:36,524 INFO L423 AbstractCegarLoop]: === Iteration 264 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:36,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:36,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2004906182, now seen corresponding path program 248 times [2018-10-04 12:34:36,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:36,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:36,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:36,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:36,593 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 264 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:36,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:36,609 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:36,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:36,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:36,613 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:36,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:36,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:36,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:36,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:36,633 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:34:37,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:37,190 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:37,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:37,191 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:37,191 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:37,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:34:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:37,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:37,486 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:37,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:37,486 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:37,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:37,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:37,487 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:37,487 INFO L423 AbstractCegarLoop]: === Iteration 265 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:37,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:37,487 INFO L82 PathProgramCache]: Analyzing trace with hash -2004904260, now seen corresponding path program 249 times [2018-10-04 12:34:37,487 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:37,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:37,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:37,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:37,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:37,556 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 265 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:37,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:37,573 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:34:37,573 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:37,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:37,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:37,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:37,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:37,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:37,609 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:38,163 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:34:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:38,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:38,164 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:34:38,164 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:34:38,164 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:38,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:34:38,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:34:38,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:38,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:38,445 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:38,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:38,445 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:38,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:38,446 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:38,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:38,446 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:38,446 INFO L423 AbstractCegarLoop]: === Iteration 266 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:38,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash -2003059140, now seen corresponding path program 250 times [2018-10-04 12:34:38,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:38,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:38,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:38,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:38,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:38,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:38,516 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 266 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:38,524 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:38,531 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:38,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:38,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:38,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:38,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:38,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:38,554 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:39,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:39,095 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:39,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:39,095 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:39,096 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:39,096 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:39,096 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:39,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:39,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:34:39,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:39,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:39,394 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:39,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:39,394 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:39,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:39,394 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:39,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:39,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:39,394 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:39,394 INFO L423 AbstractCegarLoop]: === Iteration 267 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:39,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:39,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2003057218, now seen corresponding path program 251 times [2018-10-04 12:34:39,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:39,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:39,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:39,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:39,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:39,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:39,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:39,494 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 267 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:39,502 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:39,511 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:34:39,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:39,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:39,515 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:39,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:39,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:39,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:39,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:39,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:39,536 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:40,071 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:34:40,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:40,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:40,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:40,072 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:34:40,072 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:34:40,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:34:40,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 12:34:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:40,332 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:34:40,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:40,332 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:40,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:40,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:40,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:40,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:40,333 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:40,333 INFO L423 AbstractCegarLoop]: === Iteration 268 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:40,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:40,333 INFO L82 PathProgramCache]: Analyzing trace with hash -229898820, now seen corresponding path program 252 times [2018-10-04 12:34:40,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:40,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:40,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:40,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:40,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:40,402 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 268 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:40,410 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:40,419 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:34:40,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:40,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:40,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:40,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:40,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:40,444 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:34:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:40,970 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:40,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:40,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:40,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:40,971 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:40,971 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:40,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:40,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:41,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 12:34:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:41,246 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:41,246 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:41,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:41,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:41,247 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:41,247 INFO L423 AbstractCegarLoop]: === Iteration 269 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:41,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash -229896898, now seen corresponding path program 253 times [2018-10-04 12:34:41,247 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:41,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:41,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:41,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:41,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:41,315 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 269 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:41,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:41,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:41,330 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:41,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:41,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:41,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:41,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:41,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:41,354 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:41,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:41,871 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:41,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:41,872 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:41,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:41,872 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:41,872 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:41,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:34:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:42,150 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:42,150 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:42,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:42,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:42,151 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:42,151 INFO L423 AbstractCegarLoop]: === Iteration 270 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:42,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash -228051778, now seen corresponding path program 254 times [2018-10-04 12:34:42,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:42,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:42,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:42,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:42,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:42,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:42,227 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 270 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:42,242 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:42,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:42,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:42,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:42,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:42,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:42,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:42,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:42,275 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:42,773 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:42,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:42,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:42,774 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:42,774 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:42,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:43,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:34:43,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:43,059 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:43,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:43,059 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:43,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:43,059 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:43,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:43,059 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:34:43,059 INFO L423 AbstractCegarLoop]: === Iteration 271 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:43,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash -228049856, now seen corresponding path program 255 times [2018-10-04 12:34:43,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:43,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:43,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:43,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:43,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 271 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:43,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:43,160 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:34:43,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:43,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:43,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:43,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:43,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:43,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:43,183 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:43,649 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:34:43,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:43,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:43,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:43,650 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:34:43,650 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:34:43,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:43,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:34:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:34:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:34:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:34:43,932 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 12:34:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:43,932 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:34:43,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:34:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:43,933 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:43,933 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:34:43,933 INFO L423 AbstractCegarLoop]: === Iteration 272 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:43,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:43,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1983899974, now seen corresponding path program 256 times [2018-10-04 12:34:43,933 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:43,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:43,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:43,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:43,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:44,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:44,036 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 272 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:44,043 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:44,050 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:44,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:44,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:44,052 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:44,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:44,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:44,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:44,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:44,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:44,073 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 12:34:44,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:44,679 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:44,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:44,680 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:44,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:44,680 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:44,680 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:44,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:44,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:44,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:34:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:44,966 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:44,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:44,966 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:44,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:44,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:44,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:44,967 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:44,967 INFO L423 AbstractCegarLoop]: === Iteration 273 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:44,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:44,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1983898052, now seen corresponding path program 257 times [2018-10-04 12:34:44,967 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:44,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:44,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:44,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:44,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:45,036 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:45,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:45,036 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 273 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:45,043 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:45,053 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:34:45,053 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:45,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:45,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:45,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:45,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:45,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:45,077 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:45,706 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:45,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:45,707 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:45,707 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:45,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:45,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:45,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:34:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:45,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:45,985 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:45,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:45,985 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:45,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:45,985 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:45,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:45,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:45,986 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:45,986 INFO L423 AbstractCegarLoop]: === Iteration 274 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:45,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:45,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1982052932, now seen corresponding path program 258 times [2018-10-04 12:34:45,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:45,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:45,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:45,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:45,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:46,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:46,071 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 274 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:46,079 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:46,087 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:34:46,088 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:46,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:46,091 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:46,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:46,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:46,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:46,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:46,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:46,112 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:46,704 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:34:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:46,704 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:46,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:46,705 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:34:46,705 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:34:46,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:46,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:34:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:34:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:47,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:47,017 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:47,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:47,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:47,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:47,017 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:47,018 INFO L423 AbstractCegarLoop]: === Iteration 275 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:47,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1982051010, now seen corresponding path program 259 times [2018-10-04 12:34:47,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:47,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:47,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:47,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:47,086 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 275 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:47,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:47,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:47,105 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:47,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:47,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:47,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:47,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:47,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:47,126 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:47,713 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:47,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:47,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:47,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:47,713 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:47,714 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:47,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:47,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 12:34:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:47,977 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:34:47,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:47,977 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:47,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:47,977 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:47,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:47,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:47,977 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:47,977 INFO L423 AbstractCegarLoop]: === Iteration 276 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:47,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:47,977 INFO L82 PathProgramCache]: Analyzing trace with hash -208892612, now seen corresponding path program 260 times [2018-10-04 12:34:47,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:47,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:47,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:48,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:48,050 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 276 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:48,058 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:48,065 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:48,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:48,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:48,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:48,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:48,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:48,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:48,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:48,089 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:34:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:48,730 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:48,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:48,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:48,731 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:48,731 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:48,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:48,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:49,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:34:49,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:49,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:49,023 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:49,023 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:49,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:49,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:49,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:49,024 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:49,024 INFO L423 AbstractCegarLoop]: === Iteration 277 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:49,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:49,024 INFO L82 PathProgramCache]: Analyzing trace with hash -208890690, now seen corresponding path program 261 times [2018-10-04 12:34:49,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:49,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:49,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:49,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:49,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:49,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:49,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 277 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:49,123 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:49,136 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:34:49,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:49,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:49,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:49,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:49,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:49,161 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:49,795 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:34:49,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:49,795 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:49,796 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:49,796 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:34:49,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:49,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:34:50,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:34:50,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:50,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:50,092 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:50,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:50,092 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:50,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:50,092 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:50,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:50,092 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:50,092 INFO L423 AbstractCegarLoop]: === Iteration 278 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:50,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:50,093 INFO L82 PathProgramCache]: Analyzing trace with hash -207045570, now seen corresponding path program 262 times [2018-10-04 12:34:50,093 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:50,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:50,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:50,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:50,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:50,179 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:50,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:50,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 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 278 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:50,186 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:50,193 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:50,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:50,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:50,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:50,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:50,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:50,217 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:50,827 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:34:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:50,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:50,828 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:34:50,828 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:34:50,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:34:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:34:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:51,120 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:51,121 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:51,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:51,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:51,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:51,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:51,121 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:34:51,121 INFO L423 AbstractCegarLoop]: === Iteration 279 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:51,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:51,121 INFO L82 PathProgramCache]: Analyzing trace with hash -207043648, now seen corresponding path program 263 times [2018-10-04 12:34:51,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:51,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:51,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:51,192 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:51,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:51,192 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 279 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:51,200 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:51,211 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:34:51,212 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:51,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:51,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:51,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:51,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:51,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:51,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:51,235 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:51,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:51,831 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:51,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:51,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:51,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:51,832 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:51,832 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:51,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:51,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 12:34:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:34:52,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:34:52,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:34:52,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:52,103 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:34:52,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:52,103 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:34:52,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:52,103 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:52,103 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:34:52,103 INFO L423 AbstractCegarLoop]: === Iteration 280 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:52,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:52,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1303841604, now seen corresponding path program 264 times [2018-10-04 12:34:52,104 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:52,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:52,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:52,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:52,172 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:52,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:52,172 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 280 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:52,181 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:52,191 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:34:52,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:52,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:52,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:52,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:52,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:52,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:52,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:52,215 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:34:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:52,812 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:52,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:52,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:52,813 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:52,813 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:52,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:34:53,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:53,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:53,121 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:53,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:53,121 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:53,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:53,121 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:53,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:53,121 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:53,121 INFO L423 AbstractCegarLoop]: === Iteration 281 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:53,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1303839682, now seen corresponding path program 265 times [2018-10-04 12:34:53,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:53,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:53,425 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:53,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:53,425 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 281 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:53,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:53,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:53,443 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:53,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:53,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:53,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:53,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:53,463 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:54,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:54,029 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:34:54,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:54,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:54,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:54,030 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:34:54,030 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:34:54,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:34:54,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:34:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:54,343 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:54,343 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:54,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:54,343 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:54,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:54,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:54,344 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:54,344 INFO L423 AbstractCegarLoop]: === Iteration 282 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:54,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:54,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1301994562, now seen corresponding path program 266 times [2018-10-04 12:34:54,344 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:54,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:54,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:54,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:54,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:54,431 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:54,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:54,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 282 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:54,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:54,452 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:54,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:54,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:54,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:54,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:54,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:54,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:54,474 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:55,062 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:34:55,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:55,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:55,063 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:34:55,063 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:55,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:55,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:34:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:55,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:55,352 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:55,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:55,352 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:55,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:55,352 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:55,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:55,352 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:34:55,352 INFO L423 AbstractCegarLoop]: === Iteration 283 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:55,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:55,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1301992640, now seen corresponding path program 267 times [2018-10-04 12:34:55,352 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:55,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:55,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:55,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:55,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:55,422 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:55,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:55,423 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 283 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:55,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:55,441 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:34:55,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:55,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:55,445 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:55,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:55,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:55,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:55,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:55,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:55,476 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:56,070 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:34:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:56,070 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:56,071 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:34:56,071 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:34:56,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:56,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:34:56,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 12:34:56,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:34:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:34:56,360 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:34:56,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:56,360 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:34:56,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:56,361 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:34:56,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:56,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:56,361 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:56,361 INFO L423 AbstractCegarLoop]: === Iteration 284 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:56,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:56,361 INFO L82 PathProgramCache]: Analyzing trace with hash 471165758, now seen corresponding path program 268 times [2018-10-04 12:34:56,361 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:56,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:56,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:56,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:56,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:56,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:56,431 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 284 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:56,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:56,446 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:56,446 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:56,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:56,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:56,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:56,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:56,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:56,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:56,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:56,470 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:34:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:57,026 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:57,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:57,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:57,027 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:57,027 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:57,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:57,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 12:34:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:57,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:57,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:57,332 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:57,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:57,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:57,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:57,332 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:34:57,333 INFO L423 AbstractCegarLoop]: === Iteration 285 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:57,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:57,333 INFO L82 PathProgramCache]: Analyzing trace with hash 471167680, now seen corresponding path program 269 times [2018-10-04 12:34:57,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:57,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:57,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:57,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:57,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:57,407 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:57,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:57,407 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 285 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:57,419 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:57,430 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:34:57,430 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:57,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:57,434 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:57,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:57,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:57,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:57,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:57,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:57,455 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:57,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:57,988 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:34:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:57,988 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:57,989 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:34:57,989 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:34:57,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:34:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:34:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:58,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:34:58,279 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:34:58,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:58,279 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:34:58,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:58,279 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:34:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:58,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:58,280 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:34:58,280 INFO L423 AbstractCegarLoop]: === Iteration 286 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:58,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:58,280 INFO L82 PathProgramCache]: Analyzing trace with hash 473012800, now seen corresponding path program 270 times [2018-10-04 12:34:58,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:58,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:58,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:58,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:58,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:58,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:58,349 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:58,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:58,349 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 286 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:58,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:58,368 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:34:58,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:58,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:58,372 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:58,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:58,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:58,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:58,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:58,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:58,393 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:34:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:58,914 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:34:58,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:58,915 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:58,915 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:58,915 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:34:58,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:34:59,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:34:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:34:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:34:59,206 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:34:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:59,206 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:34:59,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:34:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:34:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:34:59,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:59,206 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:34:59,206 INFO L423 AbstractCegarLoop]: === Iteration 287 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:34:59,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash 473014722, now seen corresponding path program 271 times [2018-10-04 12:34:59,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:59,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:59,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:59,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:59,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:59,429 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 287 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:59,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:59,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:59,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:59,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:34:59,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:34:59,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:34:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:59,466 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:34:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:59,973 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:34:59,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:59,973 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:34:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:59,974 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:34:59,974 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:34:59,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:34:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:00,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 12:35:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:35:00,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:35:00,171 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 12:35:00,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:00,171 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:35:00,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:00,171 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:35:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:00,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:00,171 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:35:00,171 INFO L423 AbstractCegarLoop]: === Iteration 288 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:00,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:00,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1023196730, now seen corresponding path program 272 times [2018-10-04 12:35:00,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:00,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:00,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:00,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:00,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:00,240 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 288 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:00,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:00,254 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:00,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:00,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:00,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:00,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:00,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:00,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:00,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:00,277 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 12:35:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:00,867 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:35:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:00,867 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:00,868 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:35:00,868 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:35:00,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:00,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:35:01,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:35:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:01,198 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:01,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:01,198 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:01,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:01,198 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:01,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:01,198 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:01,198 INFO L423 AbstractCegarLoop]: === Iteration 289 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:01,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:01,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1023198652, now seen corresponding path program 273 times [2018-10-04 12:35:01,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:01,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:01,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:01,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:01,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:01,266 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 289 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:01,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:01,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:01,284 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:01,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:01,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:01,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:01,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:01,307 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:01,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:01,869 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:35:01,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:01,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:01,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:01,870 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:35:01,870 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:35:01,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:01,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:35:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:35:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:02,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:02,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:02,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:02,204 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:02,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:02,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:02,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:02,204 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:02,204 INFO L423 AbstractCegarLoop]: === Iteration 290 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:02,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:02,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1025043772, now seen corresponding path program 274 times [2018-10-04 12:35:02,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:02,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:02,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:02,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:02,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:02,274 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:02,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:02,274 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 290 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:02,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:02,289 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:02,289 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:02,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:02,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:02,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:02,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:02,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:02,324 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:02,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:02,982 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:35:02,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:02,982 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:02,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:02,983 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:35:02,983 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:35:02,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:02,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:35:03,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:35:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:03,313 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:03,313 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:03,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:03,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:03,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:03,314 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:03,314 INFO L423 AbstractCegarLoop]: === Iteration 291 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:03,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1025045694, now seen corresponding path program 275 times [2018-10-04 12:35:03,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:03,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:03,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:03,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:03,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:03,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:03,385 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 291 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:03,393 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:03,401 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:03,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:03,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:03,405 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:03,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:03,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:03,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:03,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:03,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:03,426 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:04,014 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:35:04,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:04,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:04,015 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:35:04,015 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:35:04,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:35:04,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:35:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:35:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:35:04,304 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:35:04,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:04,305 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:35:04,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:04,305 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:35:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:04,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:04,305 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:04,305 INFO L423 AbstractCegarLoop]: === Iteration 292 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:04,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:04,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1496763204, now seen corresponding path program 276 times [2018-10-04 12:35:04,305 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:04,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:04,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:04,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:04,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:04,402 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:04,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:04,403 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 292 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:04,409 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:04,422 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:04,422 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:04,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:04,425 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:04,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:04,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:04,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:04,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:04,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:04,446 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:35:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:05,005 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:35:05,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:05,005 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:05,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:05,006 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:35:05,006 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:35:05,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:05,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:35:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:35:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:05,321 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:05,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:05,322 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:05,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:05,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:05,322 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:05,322 INFO L423 AbstractCegarLoop]: === Iteration 293 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:05,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1496761282, now seen corresponding path program 277 times [2018-10-04 12:35:05,322 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:05,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:05,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:05,483 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:05,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:05,484 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 293 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:05,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:05,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:05,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:05,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:05,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:05,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:05,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:05,521 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:06,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:06,069 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:35:06,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:06,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:06,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:06,070 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:35:06,070 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:35:06,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:06,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:35:06,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:35:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:06,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:06,447 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:06,447 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:06,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:06,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:06,447 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:06,447 INFO L423 AbstractCegarLoop]: === Iteration 294 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:06,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1494916162, now seen corresponding path program 278 times [2018-10-04 12:35:06,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:06,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:06,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:06,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:06,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:06,516 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 294 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:06,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:06,529 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:06,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:06,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:06,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:06,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:06,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:06,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:06,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:06,553 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:07,090 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:35:07,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:07,091 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:07,091 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:35:07,091 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:35:07,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:35:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:07,433 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:07,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:07,433 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:07,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:07,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:07,433 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:07,433 INFO L423 AbstractCegarLoop]: === Iteration 295 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:07,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:07,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1494914240, now seen corresponding path program 279 times [2018-10-04 12:35:07,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:07,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:07,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:07,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:07,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:07,506 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 295 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:07,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:07,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:07,524 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:07,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:07,527 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:07,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:07,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:07,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:07,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:07,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:07,548 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:08,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:08,062 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:35:08,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:08,063 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:08,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:08,063 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:35:08,063 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:35:08,063 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:08,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:35:08,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:35:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:35:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:35:08,358 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:35:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:08,359 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:35:08,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:35:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:08,359 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:08,359 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:08,359 INFO L423 AbstractCegarLoop]: === Iteration 296 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:08,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:08,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1703255100, now seen corresponding path program 280 times [2018-10-04 12:35:08,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:08,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:08,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:08,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:08,441 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:08,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:08,441 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 296 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:08,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:08,453 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:08,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:08,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:08,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:08,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:08,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:08,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:08,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:08,477 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:35:09,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:09,071 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:35:09,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:09,071 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:09,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:09,072 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:35:09,072 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:35:09,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:09,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:35:09,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:35:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:09,390 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:09,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:09,390 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:09,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:09,390 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:09,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:09,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:09,390 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:09,390 INFO L423 AbstractCegarLoop]: === Iteration 297 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:09,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:09,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1703257022, now seen corresponding path program 281 times [2018-10-04 12:35:09,391 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:09,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:09,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:09,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:09,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 297 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:09,468 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:09,485 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:09,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:09,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:09,488 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:09,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:09,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:09,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:09,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:09,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:09,508 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:10,084 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:35:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:10,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:10,085 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:35:10,085 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:35:10,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:35:10,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:35:10,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:10,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:10,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:10,397 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:10,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:10,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:10,397 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:10,397 INFO L423 AbstractCegarLoop]: === Iteration 298 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:10,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1705102142, now seen corresponding path program 282 times [2018-10-04 12:35:10,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:10,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:10,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:10,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:10,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:10,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:10,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 298 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:10,473 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:10,483 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:10,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:10,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:10,487 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:10,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:10,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:10,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:10,517 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:11,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:11,638 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:35:11,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:11,639 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:11,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:11,639 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:35:11,639 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:35:11,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:11,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:35:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:35:11,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:11,961 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:11,961 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:11,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:11,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:11,962 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:11,962 INFO L423 AbstractCegarLoop]: === Iteration 299 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:11,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:11,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1705104064, now seen corresponding path program 283 times [2018-10-04 12:35:11,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:11,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:11,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:11,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:12,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:12,035 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 299 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:12,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:12,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:12,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:12,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:12,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:12,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:12,075 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:12,670 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:35:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:12,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:12,671 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:35:12,671 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:35:12,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:35:13,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:35:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:35:13,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:35:13,047 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:35:13,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:13,047 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:35:13,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:35:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:13,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:13,048 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:13,048 INFO L423 AbstractCegarLoop]: === Iteration 300 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:13,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:13,048 INFO L82 PathProgramCache]: Analyzing trace with hash -816704834, now seen corresponding path program 284 times [2018-10-04 12:35:13,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:13,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:13,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:13,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:13,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:13,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 300 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:13,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:13,137 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:13,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:13,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:13,140 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:13,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:13,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:13,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:13,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:13,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:13,161 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:35:13,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:13,722 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:35:13,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:13,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:13,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:13,723 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:35:13,723 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:35:13,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:35:14,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:35:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:14,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:14,084 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:14,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:14,085 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:14,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:14,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:14,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:14,085 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:14,085 INFO L423 AbstractCegarLoop]: === Iteration 301 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:14,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash -816702912, now seen corresponding path program 285 times [2018-10-04 12:35:14,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:14,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:14,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:14,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:14,155 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 301 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:14,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:14,173 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:14,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:14,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:14,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:14,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:14,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:14,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:14,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:14,197 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:14,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:14,748 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:35:14,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:14,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:14,749 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:35:14,749 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:35:14,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:14,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:35:15,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:35:15,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:15,080 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:15,080 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:15,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:15,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:15,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:15,081 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:15,081 INFO L423 AbstractCegarLoop]: === Iteration 302 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:15,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:15,081 INFO L82 PathProgramCache]: Analyzing trace with hash -814857792, now seen corresponding path program 286 times [2018-10-04 12:35:15,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:15,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:15,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:15,150 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:15,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:15,151 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 302 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:15,157 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:15,165 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:15,165 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:15,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:15,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:15,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:15,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:15,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:15,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:15,187 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:15,729 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:35:15,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:15,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:15,730 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:35:15,730 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:35:15,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:35:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:16,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:16,050 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:16,050 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:16,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:16,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:16,050 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:16,050 INFO L423 AbstractCegarLoop]: === Iteration 303 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:16,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash -814855870, now seen corresponding path program 287 times [2018-10-04 12:35:16,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:16,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:16,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:16,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:16,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 303 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:16,132 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:16,142 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:16,142 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:16,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:16,146 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:16,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:16,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:16,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:16,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:16,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:16,166 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:16,711 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:35:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:16,711 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:16,712 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:35:16,712 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:35:16,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:35:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 12:35:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:35:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:35:16,967 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 12:35:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:16,967 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:35:16,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:35:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:16,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:16,967 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:16,967 INFO L423 AbstractCegarLoop]: === Iteration 304 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:16,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:16,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1724261308, now seen corresponding path program 288 times [2018-10-04 12:35:16,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:16,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:16,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:17,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:17,040 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 304 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:17,047 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:17,058 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:17,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:17,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:17,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:17,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:17,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:17,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:17,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:17,083 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 12:35:17,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:17,603 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:35:17,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:17,603 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:17,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:17,604 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:35:17,604 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:35:17,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:35:17,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:17,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:17,960 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:17,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:17,960 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:17,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:17,960 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:17,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:17,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:17,960 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:17,960 INFO L423 AbstractCegarLoop]: === Iteration 305 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:17,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:17,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1724263230, now seen corresponding path program 289 times [2018-10-04 12:35:17,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:17,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:17,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:17,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:18,028 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:18,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:18,028 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 305 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:18,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:18,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:18,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:18,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:18,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:18,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:18,063 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:18,600 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:35:18,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:18,600 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:18,600 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:35:18,601 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:35:18,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:35:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:18,926 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:18,927 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:18,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:18,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:18,927 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:18,927 INFO L423 AbstractCegarLoop]: === Iteration 306 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:18,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1726108350, now seen corresponding path program 290 times [2018-10-04 12:35:18,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:18,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:19,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:19,000 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 306 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:19,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:19,015 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:19,015 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:19,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:19,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:19,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:19,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:19,039 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:19,546 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:35:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:19,546 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:19,547 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:35:19,547 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:35:19,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:35:19,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 12:35:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:19,912 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:19,912 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:19,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:19,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:19,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:19,912 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:19,912 INFO L423 AbstractCegarLoop]: === Iteration 307 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:19,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:19,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1726110272, now seen corresponding path program 291 times [2018-10-04 12:35:19,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:19,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:19,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:19,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:19,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:20,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:20,054 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 307 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:20,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:20,074 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:20,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:20,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:20,081 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:20,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:20,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:20,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:20,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:20,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:20,101 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:20,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:20,596 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:35:20,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:20,596 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:20,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:20,597 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:35:20,597 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:35:20,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:20,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:35:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:35:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:35:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:35:20,899 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:35:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:20,899 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:35:20,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:35:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:20,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:20,899 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:20,899 INFO L423 AbstractCegarLoop]: === Iteration 308 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:20,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:20,900 INFO L82 PathProgramCache]: Analyzing trace with hash -795698626, now seen corresponding path program 292 times [2018-10-04 12:35:20,900 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:20,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:20,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:20,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:20,967 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:20,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:20,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 308 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:20,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:20,983 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:20,983 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:20,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:21,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:21,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:21,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:21,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:21,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:21,016 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:35:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:21,619 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:35:21,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:21,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:21,620 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:35:21,620 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:35:21,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:35:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:21,946 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:21,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:21,946 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:21,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:21,946 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:21,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:21,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:21,947 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:21,947 INFO L423 AbstractCegarLoop]: === Iteration 309 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:21,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:21,947 INFO L82 PathProgramCache]: Analyzing trace with hash -795696704, now seen corresponding path program 293 times [2018-10-04 12:35:21,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:21,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:21,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:21,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:22,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:22,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 309 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:22,026 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:22,035 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:22,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:22,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:22,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:22,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:22,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:22,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:22,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:22,060 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:22,601 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:35:22,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:22,602 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:22,602 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:35:22,602 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:35:22,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:22,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:35:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:22,949 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:22,949 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:22,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:22,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:22,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:22,949 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:22,949 INFO L423 AbstractCegarLoop]: === Iteration 310 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:22,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash -793851584, now seen corresponding path program 294 times [2018-10-04 12:35:22,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:22,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:22,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:23,016 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:23,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:23,016 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 310 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:23,024 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:23,037 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:23,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:23,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:23,041 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:23,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:23,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:23,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:23,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:23,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:23,073 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:23,611 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:35:23,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:23,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:23,612 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:35:23,612 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:35:23,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:35:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 12:35:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:23,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:23,938 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:23,938 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:23,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:23,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:23,939 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:23,939 INFO L423 AbstractCegarLoop]: === Iteration 311 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:23,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:23,939 INFO L82 PathProgramCache]: Analyzing trace with hash -793849662, now seen corresponding path program 295 times [2018-10-04 12:35:23,939 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:23,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:23,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:23,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:24,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:24,005 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 311 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:24,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:24,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:24,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:24,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:24,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:24,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:24,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:24,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:24,042 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:24,545 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:35:24,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:24,545 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:24,546 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:35:24,546 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:35:24,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:24,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:35:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:35:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:35:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:35:24,837 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:35:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:24,837 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:35:24,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:35:24,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:24,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:24,837 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:24,837 INFO L423 AbstractCegarLoop]: === Iteration 312 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:24,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:24,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1890647618, now seen corresponding path program 296 times [2018-10-04 12:35:24,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:24,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:24,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:24,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:24,963 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:24,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:24,964 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 312 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:24,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:24,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:24,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:25,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:25,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:25,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:25,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:25,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:25,002 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:35:25,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:25,491 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:35:25,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:25,492 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:25,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:25,492 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:35:25,492 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:35:25,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:35:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 12:35:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:25,840 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:25,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:25,840 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:25,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:25,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:25,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:25,841 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:25,841 INFO L423 AbstractCegarLoop]: === Iteration 313 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:25,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1890645696, now seen corresponding path program 297 times [2018-10-04 12:35:25,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:25,842 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:25,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:25,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:26,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:26,010 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 313 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:26,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:26,028 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:26,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:26,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:26,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:26,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:26,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:26,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:26,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:26,052 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:26,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:26,522 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:35:26,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:26,522 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:26,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:26,523 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:35:26,523 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:35:26,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:35:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 12:35:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:26,858 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:26,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:26,858 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:26,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:26,858 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:26,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:26,858 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:26,858 INFO L423 AbstractCegarLoop]: === Iteration 314 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:26,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1888800576, now seen corresponding path program 298 times [2018-10-04 12:35:26,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:26,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:26,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:26,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:26,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:27,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:27,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 314 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:27,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:27,141 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:27,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:27,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:27,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:27,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:27,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:27,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:27,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:27,177 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:27,718 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:35:27,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:27,719 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:27,719 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:35:27,719 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:35:27,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:27,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:35:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 12:35:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:28,051 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:28,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:28,051 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:28,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:28,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:28,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:28,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:28,051 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:28,051 INFO L423 AbstractCegarLoop]: === Iteration 315 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:28,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:28,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1888798654, now seen corresponding path program 299 times [2018-10-04 12:35:28,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:28,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:28,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:28,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:28,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:28,124 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 315 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:28,132 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:28,143 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:28,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:28,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:28,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:28,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:28,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:28,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:28,167 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:28,649 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:35:28,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:28,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:28,650 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:35:28,650 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:35:28,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:35:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:35:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:35:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:35:28,959 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:35:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:28,959 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:35:28,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:35:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:28,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:28,960 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:28,960 INFO L423 AbstractCegarLoop]: === Iteration 316 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:28,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:28,960 INFO L82 PathProgramCache]: Analyzing trace with hash -115640256, now seen corresponding path program 300 times [2018-10-04 12:35:28,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:28,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:28,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:28,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:29,029 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:29,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:29,030 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 316 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:29,038 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:29,047 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:29,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:29,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:29,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:29,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:29,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:29,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:29,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:29,077 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:35:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:29,529 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:35:29,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:29,529 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:29,530 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:35:29,530 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:35:29,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:35:29,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-10-04 12:35:29,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:29,863 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:29,863 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:29,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:29,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:29,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:29,864 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:29,864 INFO L423 AbstractCegarLoop]: === Iteration 317 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:29,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:29,864 INFO L82 PathProgramCache]: Analyzing trace with hash -115638334, now seen corresponding path program 301 times [2018-10-04 12:35:29,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:29,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:29,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:29,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:29,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:29,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:29,933 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 317 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:29,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:29,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:29,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:29,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:29,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:29,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:29,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:29,972 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:30,402 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:35:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:30,402 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:30,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:30,402 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:35:30,403 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:35:30,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:35:30,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2018-10-04 12:35:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:30,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:30,762 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:30,762 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:30,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:30,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:30,762 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:30,762 INFO L423 AbstractCegarLoop]: === Iteration 318 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:30,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:30,763 INFO L82 PathProgramCache]: Analyzing trace with hash -113793214, now seen corresponding path program 302 times [2018-10-04 12:35:30,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:30,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:30,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:30,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:30,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:30,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:30,834 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 318 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:30,842 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:30,848 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:30,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:30,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:30,852 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:30,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:30,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:30,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:30,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:30,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:30,872 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:31,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:31,309 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2018-10-04 12:35:31,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:31,310 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:31,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:31,310 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:35:31,310 INFO L226 Difference]: Without dead ends: 37 [2018-10-04 12:35:31,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-04 12:35:31,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-10-04 12:35:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:31,658 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:31,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:31,658 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:31,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:31,658 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:31,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:31,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:31,658 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:31,658 INFO L423 AbstractCegarLoop]: === Iteration 319 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:31,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash -113791292, now seen corresponding path program 303 times [2018-10-04 12:35:31,659 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:31,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:31,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:31,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:31,729 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:31,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:31,729 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 319 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:31,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:31,750 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:31,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:31,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:31,752 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:31,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:31,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:31,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:31,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:31,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:31,772 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:32,177 INFO L93 Difference]: Finished difference Result 38 states and 54 transitions. [2018-10-04 12:35:32,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:32,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:32,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:32,178 INFO L225 Difference]: With dead ends: 38 [2018-10-04 12:35:32,178 INFO L226 Difference]: Without dead ends: 36 [2018-10-04 12:35:32,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-04 12:35:32,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 22. [2018-10-04 12:35:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:35:32,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2018-10-04 12:35:32,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 19 [2018-10-04 12:35:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:32,406 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 31 transitions. [2018-10-04 12:35:32,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 31 transitions. [2018-10-04 12:35:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:32,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:32,407 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-10-04 12:35:32,407 INFO L423 AbstractCegarLoop]: === Iteration 320 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:32,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash 330139066, now seen corresponding path program 304 times [2018-10-04 12:35:32,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:32,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:32,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:32,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:32,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:32,497 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 320 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:32,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:32,567 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:32,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:32,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:32,570 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:32,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:32,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:32,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:32,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:32,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:32,601 INFO L87 Difference]: Start difference. First operand 22 states and 31 transitions. Second operand 11 states. [2018-10-04 12:35:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:33,423 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:33,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:33,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:33,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:33,424 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:33,424 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:33,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:33,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:35:33,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:35:33,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:33,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:33,800 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:33,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:33,800 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:33,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:33,800 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:33,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:33,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:33,800 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:33,800 INFO L423 AbstractCegarLoop]: === Iteration 321 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:33,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:33,800 INFO L82 PathProgramCache]: Analyzing trace with hash 330140988, now seen corresponding path program 305 times [2018-10-04 12:35:33,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:33,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:33,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:33,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:33,874 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:33,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:33,874 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 321 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:33,892 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:33,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:33,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:33,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:33,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:33,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:33,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:33,917 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:34,704 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:34,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:34,705 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:34,705 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:34,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:35:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:35:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:35,066 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:35,066 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:35,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:35,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:35,066 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:35,066 INFO L423 AbstractCegarLoop]: === Iteration 322 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:35,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 331986108, now seen corresponding path program 306 times [2018-10-04 12:35:35,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:35,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:35,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:35,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:35,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 322 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:35,227 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:35,240 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:35,240 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:35,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:35,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:35,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:35,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:35,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:35,262 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:36,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:36,008 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:35:36,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:36,008 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:36,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:36,009 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:35:36,009 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:35:36,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:35:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:35:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:36,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:36,381 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:36,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:36,381 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:36,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:36,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:36,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:36,382 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:36,382 INFO L423 AbstractCegarLoop]: === Iteration 323 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:36,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash 331988030, now seen corresponding path program 307 times [2018-10-04 12:35:36,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:36,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:36,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:36,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:36,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:36,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:36,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 323 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:36,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:36,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:36,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:36,466 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:36,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:36,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:36,486 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:37,207 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:35:37,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:37,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:37,208 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:35:37,208 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:35:37,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:35:37,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 12:35:37,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:35:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:35:37,554 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:35:37,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:37,554 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:35:37,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:37,555 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:35:37,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:37,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:37,555 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:37,555 INFO L423 AbstractCegarLoop]: === Iteration 324 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:37,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:37,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2105146428, now seen corresponding path program 308 times [2018-10-04 12:35:37,556 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:37,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:37,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:37,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:37,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:37,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:37,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 324 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:37,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:37,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:37,639 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:37,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:37,641 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:37,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:37,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:37,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:37,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:37,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:37,661 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:35:38,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:38,417 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:38,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:38,417 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:38,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:38,418 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:38,418 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:38,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:38,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:35:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:35:38,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:38,884 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:38,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:38,884 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:38,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:38,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:38,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:38,884 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:38,884 INFO L423 AbstractCegarLoop]: === Iteration 325 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:38,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:38,885 INFO L82 PathProgramCache]: Analyzing trace with hash 2105148350, now seen corresponding path program 309 times [2018-10-04 12:35:38,885 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:38,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:38,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:38,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:38,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:38,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:38,950 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 325 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:38,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:38,969 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:38,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:38,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:38,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:38,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:38,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:38,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:38,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:38,994 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:39,796 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:39,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:39,796 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:39,797 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:39,797 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:39,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:35:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:35:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:40,213 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:40,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:40,213 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:40,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:40,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:40,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:40,214 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:40,214 INFO L423 AbstractCegarLoop]: === Iteration 326 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:40,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 2106993470, now seen corresponding path program 310 times [2018-10-04 12:35:40,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:40,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:40,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:40,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:40,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:40,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:40,336 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 326 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:40,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:40,350 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:40,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:40,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:40,353 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:40,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:40,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:40,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:40,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:40,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:40,374 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:41,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:41,094 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:35:41,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:41,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:41,095 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:35:41,095 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:35:41,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:41,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:35:41,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:35:41,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:41,473 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:41,473 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:41,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:41,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:41,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:41,474 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:41,474 INFO L423 AbstractCegarLoop]: === Iteration 327 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:41,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:41,474 INFO L82 PathProgramCache]: Analyzing trace with hash 2106995392, now seen corresponding path program 311 times [2018-10-04 12:35:41,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:41,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:41,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:41,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:41,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:41,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 327 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:41,552 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:41,562 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:41,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:41,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:41,567 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:41,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:41,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:41,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:41,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:41,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:41,596 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:42,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:42,457 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:35:42,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:42,458 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:42,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:42,458 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:35:42,458 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:35:42,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:35:42,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 12:35:42,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:35:42,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:35:42,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:35:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:42,786 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:35:42,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:35:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:42,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:42,787 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:42,787 INFO L423 AbstractCegarLoop]: === Iteration 328 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:42,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:42,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1010197436, now seen corresponding path program 312 times [2018-10-04 12:35:42,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:42,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:42,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:42,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:42,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:42,857 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:42,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:42,857 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 328 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:42,865 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:42,873 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:42,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:42,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:42,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:42,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:42,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:42,897 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:35:43,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:43,648 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:35:43,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:43,648 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:43,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:43,649 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:35:43,649 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:35:43,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:35:44,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:35:44,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:44,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:44,031 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:44,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:44,031 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:44,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:44,031 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:44,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:44,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:44,031 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:44,032 INFO L423 AbstractCegarLoop]: === Iteration 329 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:44,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:44,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1010199358, now seen corresponding path program 313 times [2018-10-04 12:35:44,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:44,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:44,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:44,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:44,098 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:44,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:44,099 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 329 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:44,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:44,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:44,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:44,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:44,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:44,136 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:44,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:44,829 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:35:44,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:44,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:44,829 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:35:44,830 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:35:44,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:44,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:35:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:35:45,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:45,214 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:45,214 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:45,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:45,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:45,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:45,215 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:45,215 INFO L423 AbstractCegarLoop]: === Iteration 330 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:45,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:45,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1012044478, now seen corresponding path program 314 times [2018-10-04 12:35:45,215 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:45,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:45,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:45,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:45,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:45,286 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 330 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:45,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:45,302 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:45,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:45,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:45,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:45,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:45,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:45,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:45,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:45,331 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:46,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:46,046 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:35:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:46,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:46,046 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:35:46,047 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:35:46,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:35:46,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:35:46,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:46,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:46,439 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:46,439 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:46,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:46,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:46,440 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:46,440 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:46,440 INFO L423 AbstractCegarLoop]: === Iteration 331 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:46,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1012046400, now seen corresponding path program 315 times [2018-10-04 12:35:46,440 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:46,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:46,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:46,524 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 331 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:46,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:46,543 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:46,543 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:46,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:46,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:46,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:46,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:46,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:46,567 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:47,252 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:35:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:47,253 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:47,253 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:35:47,253 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:35:47,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:35:47,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 12:35:47,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:35:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:35:47,604 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:35:47,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:47,604 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:35:47,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:47,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:35:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:47,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:47,605 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:47,605 INFO L423 AbstractCegarLoop]: === Iteration 332 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:47,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:47,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1509762498, now seen corresponding path program 316 times [2018-10-04 12:35:47,605 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:47,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:47,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:47,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:47,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:47,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:47,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 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 332 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:47,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:47,692 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:47,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:47,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:47,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:47,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:47,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:47,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:47,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:47,716 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:35:48,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:48,395 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:35:48,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:48,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:48,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:48,396 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:35:48,396 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:35:48,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:48,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:35:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 12:35:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:48,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:48,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:48,819 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:48,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:48,819 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:48,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:48,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:48,820 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:48,820 INFO L423 AbstractCegarLoop]: === Iteration 333 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:48,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:48,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1509760576, now seen corresponding path program 317 times [2018-10-04 12:35:48,820 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:48,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:48,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:48,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:48,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 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 333 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:48,894 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:48,904 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:48,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:48,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:48,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:48,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:48,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:48,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:48,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:48,928 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:49,584 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:35:49,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:49,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:49,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:49,585 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:35:49,585 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:35:49,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:35:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:35:49,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:49,957 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:49,957 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:49,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:49,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:49,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:49,957 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:49,957 INFO L423 AbstractCegarLoop]: === Iteration 334 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:49,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:49,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1507915456, now seen corresponding path program 318 times [2018-10-04 12:35:49,958 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:49,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:49,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:50,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:50,027 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 334 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:50,040 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:50,050 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:50,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:50,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:50,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:50,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:50,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:50,075 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:50,714 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:35:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:50,714 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:50,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:50,715 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:35:50,715 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:35:50,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:50,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:35:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:35:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:51,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:51,129 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:51,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:51,129 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:51,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:51,129 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:51,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:51,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:51,130 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:51,130 INFO L423 AbstractCegarLoop]: === Iteration 335 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:51,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:51,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1507913534, now seen corresponding path program 319 times [2018-10-04 12:35:51,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:51,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:51,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:51,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:51,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:51,199 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 335 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:51,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:51,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:51,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:51,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:51,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:51,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:51,237 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:51,846 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:35:51,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:51,847 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:51,847 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:35:51,847 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:35:51,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:51,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:35:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 26. [2018-10-04 12:35:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:35:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:35:52,170 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 12:35:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:52,170 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:35:52,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:35:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:52,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:52,171 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:35:52,171 INFO L423 AbstractCegarLoop]: === Iteration 336 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:52,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1031203644, now seen corresponding path program 320 times [2018-10-04 12:35:52,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:52,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:52,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:52,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:52,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:52,252 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 336 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:52,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:52,276 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:52,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:52,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:52,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:52,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:52,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:52,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:52,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:52,299 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 12:35:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:53,099 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:53,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:53,100 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:53,100 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:53,100 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:53,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:53,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:35:53,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:35:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:53,507 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:53,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:53,507 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:53,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:53,507 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:53,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:53,507 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:53,507 INFO L423 AbstractCegarLoop]: === Iteration 337 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:53,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1031205566, now seen corresponding path program 321 times [2018-10-04 12:35:53,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:53,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:53,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:53,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:53,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:53,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:53,574 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:53,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:53,575 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 337 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:53,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:53,593 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:35:53,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:53,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:53,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:53,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:53,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:53,623 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:54,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:54,437 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:54,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:54,437 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:54,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:54,438 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:54,438 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:54,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:35:54,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:35:54,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:35:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:35:54,823 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:35:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:54,823 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:35:54,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:35:54,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:54,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:54,823 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:54,823 INFO L423 AbstractCegarLoop]: === Iteration 338 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:54,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:54,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1033050686, now seen corresponding path program 322 times [2018-10-04 12:35:54,824 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:54,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:54,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:54,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:54,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:54,891 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:54,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:54,892 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 338 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:54,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:54,907 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:54,907 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:54,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:54,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:54,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:54,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:54,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:54,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:54,930 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:35:55,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:55,706 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:35:55,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:55,707 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:55,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:55,707 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:35:55,707 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:35:55,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:35:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:35:56,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:56,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:56,096 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:56,097 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:56,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:56,097 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:56,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:56,097 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:56,097 INFO L423 AbstractCegarLoop]: === Iteration 339 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:56,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:56,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1033052608, now seen corresponding path program 323 times [2018-10-04 12:35:56,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:56,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:56,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:56,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:56,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:56,169 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 339 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:56,177 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:56,187 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:35:56,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:56,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:56,191 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:56,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:56,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:56,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:56,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:56,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:56,211 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:56,948 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:35:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:56,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:56,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:56,949 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:35:56,949 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:35:56,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:35:57,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2018-10-04 12:35:57,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:35:57,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:35:57,311 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:35:57,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:57,311 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:35:57,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:57,311 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:35:57,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:57,311 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:57,312 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:35:57,312 INFO L423 AbstractCegarLoop]: === Iteration 340 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:57,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:57,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1488756290, now seen corresponding path program 324 times [2018-10-04 12:35:57,312 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:57,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:57,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:57,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:57,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:57,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:57,389 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 340 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:57,404 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:57,526 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:35:57,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:57,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:57,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:57,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:57,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:57,553 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:35:58,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:58,368 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:58,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:58,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:58,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:58,369 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:58,369 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:58,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:35:58,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 34. [2018-10-04 12:35:58,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:35:58,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:35:58,777 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:35:58,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:58,777 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:35:58,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:35:58,778 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:35:58,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:35:58,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:58,778 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:35:58,778 INFO L423 AbstractCegarLoop]: === Iteration 341 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:35:58,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1488754368, now seen corresponding path program 325 times [2018-10-04 12:35:58,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:58,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:58,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:58,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:58,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:58,848 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:58,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:58,848 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 341 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:58,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:58,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:58,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:58,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:35:58,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:35:58,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:35:58,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:58,885 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:35:59,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:59,730 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2018-10-04 12:35:59,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:35:59,730 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:35:59,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:59,731 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:35:59,731 INFO L226 Difference]: Without dead ends: 59 [2018-10-04 12:35:59,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:35:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-04 12:36:00,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 32. [2018-10-04 12:36:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:00,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:00,113 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:00,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:00,113 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:00,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:00,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:00,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:00,113 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:00,113 INFO L423 AbstractCegarLoop]: === Iteration 342 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:00,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:00,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1486909248, now seen corresponding path program 326 times [2018-10-04 12:36:00,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:00,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:00,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:00,180 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 342 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:00,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:00,193 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:00,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:00,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:00,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:00,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:00,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:00,217 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:01,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:01,018 INFO L93 Difference]: Finished difference Result 59 states and 85 transitions. [2018-10-04 12:36:01,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:01,018 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:01,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:01,019 INFO L225 Difference]: With dead ends: 59 [2018-10-04 12:36:01,019 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:36:01,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:01,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:36:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 34. [2018-10-04 12:36:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:01,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:01,435 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:01,436 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:01,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:01,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:01,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:01,436 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:01,436 INFO L423 AbstractCegarLoop]: === Iteration 343 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:01,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:01,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1486907326, now seen corresponding path program 327 times [2018-10-04 12:36:01,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:01,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:01,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:01,510 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:01,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:01,511 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 343 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:01,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:01,531 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:01,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:01,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:01,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:01,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:01,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:01,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:01,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:01,556 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:02,323 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:36:02,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:02,324 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:02,324 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:36:02,324 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:36:02,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:36:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2018-10-04 12:36:02,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:36:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:36:02,696 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:36:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:02,697 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:36:02,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:02,697 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:36:02,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:02,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:02,697 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:02,697 INFO L423 AbstractCegarLoop]: === Iteration 344 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:02,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:02,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1711262014, now seen corresponding path program 328 times [2018-10-04 12:36:02,697 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:02,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:02,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:02,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:02,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:02,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 344 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:02,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:02,780 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:02,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:02,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:02,785 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:02,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:02,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:02,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:02,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:02,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:02,807 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:36:03,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:03,568 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:36:03,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:03,569 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:03,569 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:36:03,569 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:36:03,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:36:03,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:36:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:03,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:03,989 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:03,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:03,989 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:03,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:03,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:03,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:03,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:03,990 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:03,990 INFO L423 AbstractCegarLoop]: === Iteration 345 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:03,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:03,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1711263936, now seen corresponding path program 329 times [2018-10-04 12:36:03,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:03,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:03,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:03,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:03,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:04,058 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:04,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:04,059 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 345 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:04,066 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:04,077 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:36:04,077 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:04,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:04,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:04,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:04,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:04,101 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:04,829 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:36:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:04,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:04,830 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:36:04,830 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:36:04,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:36:05,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 32. [2018-10-04 12:36:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:05,216 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:05,216 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:05,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:05,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:05,217 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:05,217 INFO L423 AbstractCegarLoop]: === Iteration 346 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:05,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:05,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1713109056, now seen corresponding path program 330 times [2018-10-04 12:36:05,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:05,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:05,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:05,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:05,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:05,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:05,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:05,352 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 346 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:05,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:05,369 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:36:05,369 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:05,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:05,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:05,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:05,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:05,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:05,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:05,393 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:06,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:06,136 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2018-10-04 12:36:06,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:06,137 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:06,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:06,137 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:36:06,137 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:36:06,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:06,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:36:06,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-10-04 12:36:06,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:06,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:06,535 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:06,535 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:06,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:06,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:06,536 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:06,536 INFO L423 AbstractCegarLoop]: === Iteration 347 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:06,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:06,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1713110978, now seen corresponding path program 331 times [2018-10-04 12:36:06,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:06,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:06,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:06,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:06,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:06,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:06,605 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 347 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:06,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:06,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:06,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:06,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:06,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:06,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:06,643 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:07,371 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:36:07,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:07,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:07,372 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:36:07,372 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:36:07,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:36:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2018-10-04 12:36:07,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:36:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:36:07,736 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:36:07,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:07,737 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:36:07,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:07,737 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:36:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:07,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:07,737 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:07,737 INFO L423 AbstractCegarLoop]: === Iteration 348 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:07,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:07,737 INFO L82 PathProgramCache]: Analyzing trace with hash -808697920, now seen corresponding path program 332 times [2018-10-04 12:36:07,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:07,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:07,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:07,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:07,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:07,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:07,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 348 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:07,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:07,819 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:07,820 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:07,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:07,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:07,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:07,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:07,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:07,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:07,842 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:36:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:08,533 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:36:08,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:08,534 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:08,534 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:36:08,534 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:36:08,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:36:08,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2018-10-04 12:36:08,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:08,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:08,977 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:08,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:08,977 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:08,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:08,977 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:08,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:08,977 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:08,978 INFO L423 AbstractCegarLoop]: === Iteration 349 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:08,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:08,978 INFO L82 PathProgramCache]: Analyzing trace with hash -808695998, now seen corresponding path program 333 times [2018-10-04 12:36:08,978 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:08,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:08,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:08,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:09,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:09,286 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 349 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:09,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:09,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:09,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:09,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:09,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:09,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:09,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:09,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:09,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:09,327 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:10,003 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:36:10,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:10,004 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:10,004 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:36:10,004 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:36:10,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:10,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:36:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:36:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:10,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:10,406 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:10,407 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:10,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:10,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:10,407 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:10,407 INFO L423 AbstractCegarLoop]: === Iteration 350 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:10,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:10,407 INFO L82 PathProgramCache]: Analyzing trace with hash -806850878, now seen corresponding path program 334 times [2018-10-04 12:36:10,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:10,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:10,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:10,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:10,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:10,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:10,483 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 350 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:10,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:10,496 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:10,496 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:10,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:10,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:10,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:10,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:10,520 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:11,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:11,167 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:36:11,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:11,167 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:11,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:11,167 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:36:11,168 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:36:11,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:36:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:36:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:11,564 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:11,564 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:11,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:11,564 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:11,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:11,565 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:36:11,565 INFO L423 AbstractCegarLoop]: === Iteration 351 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:11,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:11,565 INFO L82 PathProgramCache]: Analyzing trace with hash -806848956, now seen corresponding path program 335 times [2018-10-04 12:36:11,565 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:11,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:11,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:11,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:11,746 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:11,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:11,747 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 351 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:11,763 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:36:11,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:11,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:11,767 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:11,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:11,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:11,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:11,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:11,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:11,787 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:12,410 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:36:12,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:12,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:12,411 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:36:12,411 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:36:12,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:36:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 24. [2018-10-04 12:36:12,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-04 12:36:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2018-10-04 12:36:12,682 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 19 [2018-10-04 12:36:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:12,682 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2018-10-04 12:36:12,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:12,682 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2018-10-04 12:36:12,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:12,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:12,682 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:36:12,682 INFO L423 AbstractCegarLoop]: === Iteration 352 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:12,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:12,683 INFO L82 PathProgramCache]: Analyzing trace with hash -256666948, now seen corresponding path program 336 times [2018-10-04 12:36:12,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:12,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:12,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:12,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:12,752 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 352 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:12,759 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:12,767 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:36:12,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:12,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:12,771 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:12,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:12,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:12,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:12,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:12,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:12,791 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand 11 states. [2018-10-04 12:36:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:13,588 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:36:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:13,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:13,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:13,589 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:36:13,589 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:36:13,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:13,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:36:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:36:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:14,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:14,010 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:14,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:14,010 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:14,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:14,011 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:14,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:14,011 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:14,011 INFO L423 AbstractCegarLoop]: === Iteration 353 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:14,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:14,011 INFO L82 PathProgramCache]: Analyzing trace with hash -256665026, now seen corresponding path program 337 times [2018-10-04 12:36:14,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:14,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:14,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:14,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:14,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:14,082 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 353 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:14,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:14,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:14,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:14,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:14,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:14,118 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:14,837 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:36:14,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:14,837 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:14,837 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:36:14,838 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:36:14,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:36:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:36:15,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:15,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:15,250 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:15,250 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:15,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:15,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:15,250 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:15,251 INFO L423 AbstractCegarLoop]: === Iteration 354 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:15,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash -254819906, now seen corresponding path program 338 times [2018-10-04 12:36:15,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:15,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:15,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:15,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:15,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:15,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:15,344 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 354 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:15,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:15,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:15,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:15,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:15,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:15,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:15,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:15,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:15,388 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:16,171 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:36:16,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:16,171 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:16,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:16,172 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:36:16,172 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:36:16,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:36:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:36:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:16,613 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:16,613 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:16,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:16,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:16,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:16,613 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:16,614 INFO L423 AbstractCegarLoop]: === Iteration 355 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:16,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:16,614 INFO L82 PathProgramCache]: Analyzing trace with hash -254817984, now seen corresponding path program 339 times [2018-10-04 12:36:16,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:16,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:16,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:16,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:16,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:16,683 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:16,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:16,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 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 355 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:16,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:16,701 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:16,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:16,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:16,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:16,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:16,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:16,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:16,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:16,725 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:17,460 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:36:17,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:17,460 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:17,460 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:36:17,461 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:36:17,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:36:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:36:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:36:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:36:17,846 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:36:17,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:17,846 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:36:17,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:17,846 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:36:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:17,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:17,847 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:17,847 INFO L423 AbstractCegarLoop]: === Iteration 356 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:17,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:17,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1518340414, now seen corresponding path program 340 times [2018-10-04 12:36:17,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:17,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:17,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:17,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:17,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:17,916 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:17,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:17,916 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 356 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:17,962 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:17,962 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:17,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:17,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:17,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:17,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:17,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:17,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:17,995 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:36:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:18,724 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:36:18,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:18,724 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:18,725 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:36:18,725 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:36:18,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:36:19,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:36:19,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:19,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:19,150 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:19,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:19,150 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:19,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:19,150 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:19,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:19,150 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:19,151 INFO L423 AbstractCegarLoop]: === Iteration 357 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:19,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1518342336, now seen corresponding path program 341 times [2018-10-04 12:36:19,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:19,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:19,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:19,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:19,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 357 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:19,227 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:19,237 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:36:19,237 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:19,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:19,241 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:19,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:19,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:19,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:19,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:19,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:19,261 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:19,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:19,958 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:36:19,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:19,958 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:19,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:19,958 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:36:19,959 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:36:19,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:19,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:36:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:36:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:20,366 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:20,366 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:20,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:20,366 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:20,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:20,366 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:20,366 INFO L423 AbstractCegarLoop]: === Iteration 358 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:20,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1520187456, now seen corresponding path program 342 times [2018-10-04 12:36:20,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:20,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:20,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:20,438 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 358 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:20,447 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:20,456 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:36:20,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:20,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:20,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:20,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:20,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:20,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:20,481 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:21,123 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:36:21,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:21,124 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:21,124 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:36:21,124 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:36:21,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:36:21,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:36:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:21,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:21,589 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:21,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:21,589 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:21,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:21,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:21,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:21,589 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:21,590 INFO L423 AbstractCegarLoop]: === Iteration 359 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:21,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:21,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1520189378, now seen corresponding path program 343 times [2018-10-04 12:36:21,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:21,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:21,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:21,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:21,663 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:21,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:21,664 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 359 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:21,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:21,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:21,680 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:21,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:21,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:21,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:21,700 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:22,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:22,343 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:36:22,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:22,343 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:22,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:22,343 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:36:22,344 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:36:22,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:22,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:36:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2018-10-04 12:36:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:36:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:36:22,720 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:36:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:22,720 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:36:22,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:36:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:22,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:22,721 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:22,721 INFO L423 AbstractCegarLoop]: === Iteration 360 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:22,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:22,721 INFO L82 PathProgramCache]: Analyzing trace with hash 423391422, now seen corresponding path program 344 times [2018-10-04 12:36:22,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:22,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:22,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:22,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:22,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:22,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:22,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 360 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:22,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:22,805 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:22,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:22,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:22,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:22,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:22,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:22,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:22,830 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:36:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:23,595 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:36:23,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:23,595 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:23,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:23,596 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:36:23,596 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:36:23,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:23,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:36:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:36:24,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:24,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:24,017 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:24,018 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:24,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:24,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:24,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:24,018 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:24,018 INFO L423 AbstractCegarLoop]: === Iteration 361 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:24,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:24,018 INFO L82 PathProgramCache]: Analyzing trace with hash 423393344, now seen corresponding path program 345 times [2018-10-04 12:36:24,018 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:24,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:24,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:24,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:24,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:24,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:24,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 361 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:24,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:24,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:24,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:24,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:24,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:24,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:24,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:24,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:24,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:24,179 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:24,917 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:36:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:24,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:24,917 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:36:24,918 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:36:24,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:36:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 32. [2018-10-04 12:36:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:25,332 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:25,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:25,332 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:25,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:25,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:25,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:25,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:25,332 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:25,332 INFO L423 AbstractCegarLoop]: === Iteration 362 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:25,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:25,332 INFO L82 PathProgramCache]: Analyzing trace with hash 425238464, now seen corresponding path program 346 times [2018-10-04 12:36:25,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:25,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:25,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:25,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:25,406 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 362 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:25,415 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:25,421 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:25,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:25,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:25,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:25,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:25,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:25,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:25,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:25,455 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:26,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:26,235 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2018-10-04 12:36:26,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:26,235 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:26,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:26,236 INFO L225 Difference]: With dead ends: 55 [2018-10-04 12:36:26,236 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:36:26,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:26,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:36:26,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2018-10-04 12:36:26,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:26,675 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:26,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:26,675 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:26,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:26,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:26,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:26,676 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:26,676 INFO L423 AbstractCegarLoop]: === Iteration 363 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:26,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:26,676 INFO L82 PathProgramCache]: Analyzing trace with hash 425240386, now seen corresponding path program 347 times [2018-10-04 12:36:26,676 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:26,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:26,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:26,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:26,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:26,766 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 363 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:26,773 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:26,783 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:36:26,783 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:26,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:26,786 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:26,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:26,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:26,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:26,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:26,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:26,807 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:27,536 INFO L93 Difference]: Finished difference Result 53 states and 76 transitions. [2018-10-04 12:36:27,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:27,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:27,537 INFO L225 Difference]: With dead ends: 53 [2018-10-04 12:36:27,537 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:36:27,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:36:27,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 30. [2018-10-04 12:36:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:36:27,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:36:27,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:36:27,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:27,927 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:36:27,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:27,927 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:36:27,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:27,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:27,927 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:27,927 INFO L423 AbstractCegarLoop]: === Iteration 364 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:27,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:27,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2096568512, now seen corresponding path program 348 times [2018-10-04 12:36:27,928 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:27,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:27,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:27,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:27,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:27,995 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:27,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:27,996 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 364 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:28,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:28,012 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:36:28,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:28,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:28,015 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:28,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:28,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:28,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:28,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:28,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:28,037 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:36:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:28,733 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:36:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:28,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:28,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:28,734 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:36:28,734 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:36:28,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:36:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 34. [2018-10-04 12:36:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:29,161 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:29,161 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:29,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:29,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:29,161 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:29,162 INFO L423 AbstractCegarLoop]: === Iteration 365 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:29,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:29,162 INFO L82 PathProgramCache]: Analyzing trace with hash -2096566590, now seen corresponding path program 349 times [2018-10-04 12:36:29,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:29,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:29,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:29,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:29,244 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:29,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:29,245 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 365 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:29,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:29,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:29,285 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:29,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:29,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:29,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:29,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:29,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:29,306 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:30,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:30,010 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2018-10-04 12:36:30,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:30,011 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:30,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:30,011 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:36:30,011 INFO L226 Difference]: Without dead ends: 49 [2018-10-04 12:36:30,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:30,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-04 12:36:30,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2018-10-04 12:36:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:30,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:30,473 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:30,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:30,473 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:30,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:30,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:30,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:30,474 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:30,474 INFO L423 AbstractCegarLoop]: === Iteration 366 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:30,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash -2094721470, now seen corresponding path program 350 times [2018-10-04 12:36:30,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:30,544 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:30,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:30,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 366 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:30,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:30,560 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:30,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:30,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:30,564 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:30,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:30,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:30,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:30,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:30,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:30,584 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:31,254 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:36:31,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:31,255 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:31,255 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:36:31,255 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:36:31,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:36:31,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:36:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:31,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:31,708 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:31,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:31,708 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:31,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:31,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:31,708 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:36:31,708 INFO L423 AbstractCegarLoop]: === Iteration 367 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:31,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash -2094719548, now seen corresponding path program 351 times [2018-10-04 12:36:31,709 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:31,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:31,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:31,811 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:31,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:31,811 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 367 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:31,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:31,830 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:31,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:31,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:31,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:31,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:31,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:31,854 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:32,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:32,486 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:36:32,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:32,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:32,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:32,487 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:36:32,487 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:36:32,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:32,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:36:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-10-04 12:36:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:36:32,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2018-10-04 12:36:32,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 19 [2018-10-04 12:36:32,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:32,839 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 37 transitions. [2018-10-04 12:36:32,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:32,839 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 37 transitions. [2018-10-04 12:36:32,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:32,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:32,839 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:32,839 INFO L423 AbstractCegarLoop]: === Iteration 368 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:32,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash 444397630, now seen corresponding path program 352 times [2018-10-04 12:36:32,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:32,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:32,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:32,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:32,907 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:32,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:32,907 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 368 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:32,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:32,920 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:32,921 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:32,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:32,923 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:32,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:32,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:32,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:32,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:32,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:32,943 INFO L87 Difference]: Start difference. First operand 26 states and 37 transitions. Second operand 11 states. [2018-10-04 12:36:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:33,610 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:36:33,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:33,610 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:33,611 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:36:33,611 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:36:33,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:36:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:36:34,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:34,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:34,045 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:34,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:34,045 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:34,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:34,045 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:34,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:34,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:34,045 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:34,045 INFO L423 AbstractCegarLoop]: === Iteration 369 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:34,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:34,046 INFO L82 PathProgramCache]: Analyzing trace with hash 444399552, now seen corresponding path program 353 times [2018-10-04 12:36:34,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:34,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:34,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:34,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:34,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:34,113 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 369 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:34,120 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:34,129 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:36:34,129 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:34,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:34,133 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:34,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:34,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:34,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:34,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:34,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:34,160 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:34,826 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:36:34,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:34,826 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:34,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:34,826 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:36:34,827 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:36:34,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:34,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:36:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:36:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:35,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:35,288 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:35,289 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:35,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:35,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:35,289 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:35,289 INFO L423 AbstractCegarLoop]: === Iteration 370 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:35,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:35,289 INFO L82 PathProgramCache]: Analyzing trace with hash 446244672, now seen corresponding path program 354 times [2018-10-04 12:36:35,290 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:35,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:35,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:35,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:35,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:35,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 370 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:35,365 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:35,375 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:36:35,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:35,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:35,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:35,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:35,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:35,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:35,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:35,401 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:36,035 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:36:36,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:36,036 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:36,036 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:36:36,036 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:36:36,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:36,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:36:36,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 12:36:36,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:36,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:36,520 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:36,520 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:36,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:36,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:36,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:36,521 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:36,521 INFO L423 AbstractCegarLoop]: === Iteration 371 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:36,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:36,521 INFO L82 PathProgramCache]: Analyzing trace with hash 446246594, now seen corresponding path program 355 times [2018-10-04 12:36:36,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:36,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:36,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:36,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:36,646 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 371 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:36,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:36,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:36,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:36,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:36,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:36,681 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:37,276 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:36:37,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:37,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:37,277 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:36:37,277 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:36:37,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:36:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-10-04 12:36:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:36:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:36:37,709 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:36:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:37,709 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:36:37,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:36:37,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:37,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:37,710 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:37,710 INFO L423 AbstractCegarLoop]: === Iteration 372 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:37,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:37,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2075562304, now seen corresponding path program 356 times [2018-10-04 12:36:37,710 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:37,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:37,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:37,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:37,776 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:37,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:37,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 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 372 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:37,784 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:37,792 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:37,792 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:37,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:37,795 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:37,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:37,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:37,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:37,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:37,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:37,815 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:36:38,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:38,484 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:36:38,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:38,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:38,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:38,485 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:36:38,485 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:36:38,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:36:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-10-04 12:36:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:38,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:38,921 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:38,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:38,921 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:38,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:38,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:38,921 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:38,922 INFO L423 AbstractCegarLoop]: === Iteration 373 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:38,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:38,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2075560382, now seen corresponding path program 357 times [2018-10-04 12:36:38,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:38,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:38,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:38,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:38,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:38,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:38,992 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 373 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:39,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:39,014 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:39,014 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:39,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:39,018 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:39,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:39,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:39,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:39,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:39,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:39,038 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:39,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:39,694 INFO L93 Difference]: Finished difference Result 49 states and 70 transitions. [2018-10-04 12:36:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:39,695 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:39,695 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:36:39,695 INFO L226 Difference]: Without dead ends: 47 [2018-10-04 12:36:39,695 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-04 12:36:40,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2018-10-04 12:36:40,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:40,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:40,150 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:40,150 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:40,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:40,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:40,150 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:40,150 INFO L423 AbstractCegarLoop]: === Iteration 374 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:40,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:40,151 INFO L82 PathProgramCache]: Analyzing trace with hash -2073715262, now seen corresponding path program 358 times [2018-10-04 12:36:40,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:40,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:40,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:40,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:40,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:40,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:40,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:40,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 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 374 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:40,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:40,231 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:40,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:40,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:40,233 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:40,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:40,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:40,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:40,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:40,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:40,254 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:40,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:40,917 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2018-10-04 12:36:40,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:40,917 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:40,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:40,918 INFO L225 Difference]: With dead ends: 47 [2018-10-04 12:36:40,918 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:36:40,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:36:41,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2018-10-04 12:36:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:41,357 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:41,357 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:41,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:41,357 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:41,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:41,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:41,357 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:36:41,357 INFO L423 AbstractCegarLoop]: === Iteration 375 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:41,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:41,357 INFO L82 PathProgramCache]: Analyzing trace with hash -2073713340, now seen corresponding path program 359 times [2018-10-04 12:36:41,358 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:41,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:41,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:41,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:41,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:41,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:41,424 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 375 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:41,432 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:41,441 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:36:41,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:41,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:41,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:41,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:41,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:41,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:41,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:41,464 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:42,059 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:36:42,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:42,060 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:42,060 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:36:42,060 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:36:42,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:36:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-10-04 12:36:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-04 12:36:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2018-10-04 12:36:42,442 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 19 [2018-10-04 12:36:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:42,442 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 40 transitions. [2018-10-04 12:36:42,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 40 transitions. [2018-10-04 12:36:42,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:42,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:42,443 INFO L375 BasicCegarLoop]: trace histogram [8, 4, 4, 1, 1, 1] [2018-10-04 12:36:42,443 INFO L423 AbstractCegarLoop]: === Iteration 376 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:42,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:42,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1124456000, now seen corresponding path program 360 times [2018-10-04 12:36:42,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:42,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:42,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:42,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:42,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:42,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 376 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:42,520 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:42,529 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:36:42,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:42,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:42,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:42,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:42,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:42,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:42,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:42,556 INFO L87 Difference]: Start difference. First operand 28 states and 40 transitions. Second operand 11 states. [2018-10-04 12:36:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:43,146 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:36:43,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:43,146 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:43,147 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:36:43,147 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:36:43,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:43,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:36:43,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 12:36:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:43,589 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:43,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:43,589 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:43,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:43,589 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:43,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:43,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:43,589 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:43,589 INFO L423 AbstractCegarLoop]: === Iteration 377 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:43,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:43,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1124457922, now seen corresponding path program 361 times [2018-10-04 12:36:43,590 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:43,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:43,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:43,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:43,686 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:43,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:43,686 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 377 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:43,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:43,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:43,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:43,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:43,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:43,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:43,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:43,723 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:44,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:44,312 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:36:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:44,313 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:44,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:44,313 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:36:44,313 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:36:44,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:44,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:36:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2018-10-04 12:36:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:36:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2018-10-04 12:36:44,749 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 19 [2018-10-04 12:36:44,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:44,749 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2018-10-04 12:36:44,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2018-10-04 12:36:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:44,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:44,749 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:44,749 INFO L423 AbstractCegarLoop]: === Iteration 378 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:44,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:44,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1126303042, now seen corresponding path program 362 times [2018-10-04 12:36:44,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:44,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:44,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:44,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:44,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:44,839 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 378 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:44,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:44,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:44,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:44,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:44,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:44,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:44,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:44,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:44,877 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 11 states. [2018-10-04 12:36:45,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:45,583 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2018-10-04 12:36:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:45,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:45,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:45,584 INFO L225 Difference]: With dead ends: 45 [2018-10-04 12:36:45,584 INFO L226 Difference]: Without dead ends: 43 [2018-10-04 12:36:45,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:45,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-04 12:36:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 34. [2018-10-04 12:36:46,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:46,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:46,054 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:46,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:46,055 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:46,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:46,055 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:46,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:46,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:46,055 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:36:46,055 INFO L423 AbstractCegarLoop]: === Iteration 379 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:46,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:46,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1126304964, now seen corresponding path program 363 times [2018-10-04 12:36:46,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:46,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:46,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:46,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:46,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:46,128 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 379 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:46,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:46,145 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:36:46,145 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:46,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:46,148 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:46,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:46,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:46,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:46,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:46,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:46,168 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. [2018-10-04 12:36:46,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:46,746 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2018-10-04 12:36:46,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:46,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:46,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:46,746 INFO L225 Difference]: With dead ends: 43 [2018-10-04 12:36:46,747 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:36:46,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:36:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2018-10-04 12:36:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-04 12:36:47,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2018-10-04 12:36:47,157 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 19 [2018-10-04 12:36:47,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:47,157 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2018-10-04 12:36:47,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:47,157 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2018-10-04 12:36:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:47,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:47,157 INFO L375 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-10-04 12:36:47,157 INFO L423 AbstractCegarLoop]: === Iteration 380 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:47,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1395503934, now seen corresponding path program 364 times [2018-10-04 12:36:47,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:47,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:47,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:47,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:47,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:47,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:47,238 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 380 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:47,246 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:47,253 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:47,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:47,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:47,256 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:47,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:47,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:47,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:47,277 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand 11 states. [2018-10-04 12:36:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:47,826 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2018-10-04 12:36:47,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:36:47,827 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-10-04 12:36:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:47,827 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:36:47,827 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:36:47,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:36:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-10-04 12:36:48,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:36:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-10-04 12:36:48,268 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 19 [2018-10-04 12:36:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:48,268 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-10-04 12:36:48,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:36:48,269 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2018-10-04 12:36:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:36:48,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:48,269 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 12:36:48,269 INFO L423 AbstractCegarLoop]: === Iteration 381 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:36:48,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1395502012, now seen corresponding path program 365 times [2018-10-04 12:36:48,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:48,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:48,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:48,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:48,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:48,340 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 381 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:48,348 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:48,358 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:36:48,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:48,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:48,361 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:48,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:48,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:36:48,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:36:48,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:36:48,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-04 12:36:48,381 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 11 states. Received shutdown request... [2018-10-04 12:36:48,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:36:48,722 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:36:48,729 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:36:48,729 INFO L202 PluginConnector]: Adding new model Luxembourg-sophisticated.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:36:48 BoogieIcfgContainer [2018-10-04 12:36:48,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:36:48,730 INFO L168 Benchmark]: Toolchain (without parser) took 258922.80 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -433.1 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 468.4 MB). Peak memory consumption was 35.3 MB. Max. memory is 7.1 GB. [2018-10-04 12:36:48,732 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:36:48,732 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.00 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:36:48,733 INFO L168 Benchmark]: Boogie Preprocessor took 29.01 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:36:48,733 INFO L168 Benchmark]: RCFGBuilder took 306.09 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:36:48,733 INFO L168 Benchmark]: TraceAbstraction took 258537.33 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -433.1 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 447.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2018-10-04 12:36:48,735 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 46.00 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 29.01 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 306.09 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 258537.33 ms. Allocated memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: -433.1 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 447.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (34states) and FLOYD_HOARE automaton (currently 8 states, 11 states before enhancement), while ReachableStatesComputation was computing reachable states (16 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 258.4s OverallTime, 381 OverallIterations, 8 TraceHistogramMax, 134.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1524 SDtfs, 2925 SDslu, 5225 SDs, 0 SdLazy, 8868 SolverSat, 4922 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9160 GetRequests, 6233 SyntacticMatches, 0 SemanticMatches, 2927 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 36.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=256, 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: 67.9s AutomataMinimizationTime, 380 MinimizatonAttempts, 5648 StatesRemovedByMinimization, 380 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 39.0s InterpolantComputationTime, 12467 NumberOfCodeBlocks, 12467 NumberOfCodeBlocksAsserted, 2157 NumberOfCheckSat, 11706 ConstructedInterpolants, 0 QuantifiedInterpolants, 534792 SizeOfPredicates, 380 NumberOfNonLiveVariables, 16150 ConjunctsInSsa, 3306 ConjunctsInUnsatCore, 761 InterpolantComputations, 1 PerfectInterpolantSequences, 0/35572 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/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-36-48-744.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-sophisticated.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-36-48-744.csv Completed graceful shutdown