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/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:32:09,475 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:32:09,477 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:32:09,489 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:32:09,489 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:32:09,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:32:09,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:32:09,493 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:32:09,495 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:32:09,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:32:09,496 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:32:09,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:32:09,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:32:09,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:32:09,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:32:09,500 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:32:09,501 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:32:09,503 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:32:09,505 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:32:09,506 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:32:09,507 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:32:09,509 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:32:09,511 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:32:09,511 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:32:09,512 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:32:09,512 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:32:09,513 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:32:09,514 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:32:09,515 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:32:09,516 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:32:09,517 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:32:09,517 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:32:09,517 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:32:09,518 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:32:09,519 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:32:09,519 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:32:09,520 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:32:09,535 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:32:09,535 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:32:09,536 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:32:09,536 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:32:09,537 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:32:09,537 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:32:09,537 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:32:09,537 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:32:09,538 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:32:09,538 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:32:09,538 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:32:09,538 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:32:09,538 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:32:09,539 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:32:09,539 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:32:09,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:32:09,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:32:09,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:32:09,540 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:32:09,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:32:09,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:32:09,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:32:09,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:32:09,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:32:09,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:32:09,541 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:32:09,541 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:32:09,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:32:09,541 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:32:09,542 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:32:09,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:32:09,617 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:32:09,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:32:09,625 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:32:09,626 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:32:09,627 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-09-26 21:32:09,628 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-09-26 21:32:09,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:32:09,700 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:32:09,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:32:09,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:32:09,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:32:09,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,746 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:32:09,747 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:32:09,747 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:32:09,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:32:09,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:32:09,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:32:09,767 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:32:09,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... [2018-09-26 21:32:09,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:32:09,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:32:09,800 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:32:09,800 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:32:09,801 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:32:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 21:32:09,881 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 21:32:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-26 21:32:10,100 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:32:10,101 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:32:10 BoogieIcfgContainer [2018-09-26 21:32:10,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:32:10,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:32:10,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:32:10,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:32:10,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:09" (1/2) ... [2018-09-26 21:32:10,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783fb141 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:32:10, skipping insertion in model container [2018-09-26 21:32:10,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:32:10" (2/2) ... [2018-09-26 21:32:10,110 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-09-26 21:32:10,120 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:32:10,129 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:32:10,191 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:32:10,192 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:32:10,192 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:32:10,192 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:32:10,193 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:32:10,193 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:32:10,193 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:32:10,193 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:32:10,194 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:32:10,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 21:32:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:32:10,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:10,230 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:32:10,232 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:10,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:10,243 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-26 21:32:10,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:10,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:10,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:10,510 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:32:10,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 21:32:10,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:32:10,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:32:10,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:32:10,534 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-26 21:32:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:10,680 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-26 21:32:10,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:32:10,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 21:32:10,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:10,700 INFO L225 Difference]: With dead ends: 17 [2018-09-26 21:32:10,700 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 21:32:10,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-09-26 21:32:10,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 21:32:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-26 21:32:10,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 21:32:10,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 21:32:10,786 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-26 21:32:10,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:10,787 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 21:32:10,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:32:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 21:32:10,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:32:10,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:10,788 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-26 21:32:10,789 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:10,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:10,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-26 21:32:10,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:10,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:10,975 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:10,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:10,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:11,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:11,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:11,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:11,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:11,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:11,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:11,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-26 21:32:11,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:32:11,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:32:11,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:32:11,271 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 21:32:11,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:11,386 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 21:32:11,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:32:11,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 21:32:11,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:11,387 INFO L225 Difference]: With dead ends: 15 [2018-09-26 21:32:11,388 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 21:32:11,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:32:11,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 21:32:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-26 21:32:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 21:32:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 21:32:11,393 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-26 21:32:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:11,394 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 21:32:11,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:32:11,394 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 21:32:11,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:32:11,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:11,395 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-26 21:32:11,395 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:11,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:11,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-26 21:32:11,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:11,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:11,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:11,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:11,590 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:11,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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:11,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:11,648 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:11,648 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:11,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:11,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:11,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:11,754 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:11,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:11,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:11,849 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:11,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-26 21:32:11,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:32:11,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:32:11,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:32:11,851 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-26 21:32:11,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:11,915 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 21:32:11,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:32:11,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:32:11,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:11,920 INFO L225 Difference]: With dead ends: 19 [2018-09-26 21:32:11,920 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 21:32:11,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:32:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 21:32:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 21:32:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 21:32:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 21:32:11,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-26 21:32:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:11,932 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 21:32:11,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:32:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 21:32:11,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:32:11,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:11,933 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-26 21:32:11,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:11,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:11,937 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-26 21:32:11,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:11,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:11,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:11,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:12,099 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:12,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:12,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:12,138 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-26 21:32:12,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:12,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:12,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:12,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:12,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:12,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-26 21:32:12,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:32:12,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:32:12,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:32:12,294 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 21:32:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:12,370 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 21:32:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:32:12,370 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 21:32:12,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:12,371 INFO L225 Difference]: With dead ends: 23 [2018-09-26 21:32:12,372 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 21:32:12,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:32:12,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 21:32:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-26 21:32:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 21:32:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 21:32:12,378 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-26 21:32:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:12,378 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 21:32:12,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:32:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 21:32:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:32:12,379 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:12,380 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-26 21:32:12,380 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:12,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:12,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-26 21:32:12,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:12,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:12,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:12,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:12,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-09-26 21:32:12,507 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:12,507 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:12,516 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:12,530 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:12,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:12,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:12,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:12,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:12,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:12,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-26 21:32:12,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:32:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:32:12,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:32:12,781 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 21:32:12,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:12,961 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 21:32:12,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:32:12,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 21:32:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:12,963 INFO L225 Difference]: With dead ends: 27 [2018-09-26 21:32:12,963 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 21:32:12,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:32:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 21:32:12,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-26 21:32:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 21:32:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 21:32:12,975 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-26 21:32:12,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:12,975 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 21:32:12,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:32:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 21:32:12,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 21:32:12,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:12,977 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-26 21:32:12,978 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:12,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-26 21:32:12,980 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:12,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:13,251 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:13,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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:13,261 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:13,353 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-26 21:32:13,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:13,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:13,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:13,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:13,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:13,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-26 21:32:13,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:32:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:32:13,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:32:13,592 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-26 21:32:13,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:13,681 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 21:32:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:32:13,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-26 21:32:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:13,683 INFO L225 Difference]: With dead ends: 31 [2018-09-26 21:32:13,684 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 21:32:13,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:32:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 21:32:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-26 21:32:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:32:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 21:32:13,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-26 21:32:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:13,690 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 21:32:13,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:32:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 21:32:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:32:13,691 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:13,692 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-26 21:32:13,692 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:13,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:13,692 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-26 21:32:13,692 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:13,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:13,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:13,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:13,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:13,880 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:13,880 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:13,891 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:13,918 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-26 21:32:13,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:13,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:13,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:13,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:14,162 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:14,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-26 21:32:14,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:32:14,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:32:14,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:32:14,164 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-26 21:32:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:14,253 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 21:32:14,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:32:14,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 21:32:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:14,256 INFO L225 Difference]: With dead ends: 35 [2018-09-26 21:32:14,256 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:32:14,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:32:14,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:32:14,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-26 21:32:14,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 21:32:14,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 21:32:14,262 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-26 21:32:14,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:14,262 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 21:32:14,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:32:14,263 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 21:32:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 21:32:14,264 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:14,264 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-26 21:32:14,264 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:14,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-26 21:32:14,264 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:14,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:14,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:14,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:14,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:14,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:14,538 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:14,539 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:14,539 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:14,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:14,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:14,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:14,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:14,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:14,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:14,815 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:14,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-26 21:32:14,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:32:14,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:32:14,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:32:14,817 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-26 21:32:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:15,040 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 21:32:15,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:32:15,041 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-26 21:32:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:15,043 INFO L225 Difference]: With dead ends: 39 [2018-09-26 21:32:15,043 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 21:32:15,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:32:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 21:32:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-26 21:32:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:32:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 21:32:15,049 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-26 21:32:15,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:15,049 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 21:32:15,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:32:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 21:32:15,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 21:32:15,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:15,051 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-26 21:32:15,051 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:15,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:15,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-26 21:32:15,051 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:15,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:15,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:15,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:15,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:15,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:15,268 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:15,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:15,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:15,315 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:15,316 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:15,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:15,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:15,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:15,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:15,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:15,553 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:15,573 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:15,574 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-26 21:32:15,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:32:15,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:32:15,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:32:15,576 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-26 21:32:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:15,674 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 21:32:15,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:32:15,675 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-26 21:32:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:15,676 INFO L225 Difference]: With dead ends: 43 [2018-09-26 21:32:15,676 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 21:32:15,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:32:15,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 21:32:15,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-26 21:32:15,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 21:32:15,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 21:32:15,684 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-26 21:32:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:15,684 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 21:32:15,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:32:15,685 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 21:32:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 21:32:15,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:15,686 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-26 21:32:15,686 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:15,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:15,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-26 21:32:15,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:15,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:15,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:15,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:15,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:15,861 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:15,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:15,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:15,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:15,894 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-26 21:32:15,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:15,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:15,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:15,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:15,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:15,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:16,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:16,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-26 21:32:16,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:32:16,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:32:16,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:32:16,120 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-26 21:32:16,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:16,295 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 21:32:16,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:32:16,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-26 21:32:16,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:16,297 INFO L225 Difference]: With dead ends: 47 [2018-09-26 21:32:16,297 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 21:32:16,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:32:16,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 21:32:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-26 21:32:16,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 21:32:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 21:32:16,304 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-26 21:32:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:16,305 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 21:32:16,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:32:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 21:32:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:32:16,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:16,306 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-26 21:32:16,307 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:16,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:16,307 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-26 21:32:16,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:16,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:16,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:16,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:16,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:16,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:17,036 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:17,037 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:17,037 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:17,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:17,088 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:17,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:17,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:17,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:17,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:17,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:17,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:17,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:17,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-26 21:32:17,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 21:32:17,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 21:32:17,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:32:17,786 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-26 21:32:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:17,898 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 21:32:17,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:32:17,898 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-26 21:32:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:17,900 INFO L225 Difference]: With dead ends: 51 [2018-09-26 21:32:17,900 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 21:32:17,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:32:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 21:32:17,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-26 21:32:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 21:32:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 21:32:17,905 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-26 21:32:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:17,906 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 21:32:17,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 21:32:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 21:32:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 21:32:17,907 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:17,907 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-26 21:32:17,907 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:17,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-26 21:32:17,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:17,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:17,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:17,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:18,150 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:18,151 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:18,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:18,160 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:18,218 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-26 21:32:18,219 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:18,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:18,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:18,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:18,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:18,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:18,588 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:18,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-26 21:32:18,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 21:32:18,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 21:32:18,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:32:18,589 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-26 21:32:18,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:18,721 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 21:32:18,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:32:18,722 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-26 21:32:18,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:18,723 INFO L225 Difference]: With dead ends: 55 [2018-09-26 21:32:18,723 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 21:32:18,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:32:18,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 21:32:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-26 21:32:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 21:32:18,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 21:32:18,730 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-26 21:32:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:18,730 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 21:32:18,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 21:32:18,730 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 21:32:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 21:32:18,731 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:18,732 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-26 21:32:18,732 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:18,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:18,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-26 21:32:18,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:18,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:18,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:19,382 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:19,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:19,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:19,445 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-26 21:32:19,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:19,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:19,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:19,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:19,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:19,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:19,762 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:19,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:19,783 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-26 21:32:19,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 21:32:19,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 21:32:19,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:32:19,789 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-26 21:32:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:19,899 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 21:32:19,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:32:19,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-26 21:32:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:19,900 INFO L225 Difference]: With dead ends: 59 [2018-09-26 21:32:19,901 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 21:32:19,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:32:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 21:32:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-26 21:32:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 21:32:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 21:32:19,908 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-26 21:32:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:19,909 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 21:32:19,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 21:32:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 21:32:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 21:32:19,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:19,910 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-26 21:32:19,910 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:19,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:19,911 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-26 21:32:19,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:19,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:19,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:19,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:20,191 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:20,192 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:20,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:20,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:20,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:20,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:20,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:20,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:20,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:20,588 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:20,588 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-26 21:32:20,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 21:32:20,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 21:32:20,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:32:20,589 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-26 21:32:20,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:20,813 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 21:32:20,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:32:20,815 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-26 21:32:20,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:20,816 INFO L225 Difference]: With dead ends: 63 [2018-09-26 21:32:20,816 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 21:32:20,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:32:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 21:32:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-26 21:32:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 21:32:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 21:32:20,823 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-26 21:32:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:20,823 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 21:32:20,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 21:32:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 21:32:20,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:32:20,824 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:20,824 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-26 21:32:20,824 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:20,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:20,825 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-26 21:32:20,825 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:20,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:20,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,103 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,103 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:21,103 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:21,135 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:21,136 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:21,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:21,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:21,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:21,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:21,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:21,447 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:21,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-26 21:32:21,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 21:32:21,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 21:32:21,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:32:21,469 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-26 21:32:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:21,658 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 21:32:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:32:21,659 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-26 21:32:21,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:21,659 INFO L225 Difference]: With dead ends: 67 [2018-09-26 21:32:21,660 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 21:32:21,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:32:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 21:32:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-26 21:32:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 21:32:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 21:32:21,666 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-26 21:32:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:21,667 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 21:32:21,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 21:32:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 21:32:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 21:32:21,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:21,668 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-26 21:32:21,668 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:21,669 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-26 21:32:21,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:21,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:21,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:21,960 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:21,997 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-26 21:32:21,997 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:22,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:22,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:22,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:22,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:22,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-26 21:32:22,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 21:32:22,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 21:32:22,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:32:22,302 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-26 21:32:22,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:22,445 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 21:32:22,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:32:22,446 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-26 21:32:22,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:22,447 INFO L225 Difference]: With dead ends: 71 [2018-09-26 21:32:22,447 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 21:32:22,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:32:22,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 21:32:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-26 21:32:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 21:32:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 21:32:22,454 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-26 21:32:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:22,454 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 21:32:22,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 21:32:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 21:32:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 21:32:22,455 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:22,455 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-26 21:32:22,456 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:22,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-26 21:32:22,456 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:22,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:22,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:22,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:22,860 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:22,860 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:22,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:22,890 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:22,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:22,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:22,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:22,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,927 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:23,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:23,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-26 21:32:23,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:32:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:32:23,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:32:23,329 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-26 21:32:23,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:23,444 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 21:32:23,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:32:23,444 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-26 21:32:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:23,445 INFO L225 Difference]: With dead ends: 75 [2018-09-26 21:32:23,445 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 21:32:23,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:32:23,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 21:32:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-26 21:32:23,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 21:32:23,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 21:32:23,451 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-26 21:32:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:23,452 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 21:32:23,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:32:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 21:32:23,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 21:32:23,453 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:23,453 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-26 21:32:23,453 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:23,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-26 21:32:23,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:23,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:23,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:24,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:24,006 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:24,013 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:24,050 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-26 21:32:24,050 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:24,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:24,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:24,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:24,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:24,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:24,463 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:24,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-26 21:32:24,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 21:32:24,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 21:32:24,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:32:24,465 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-26 21:32:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:24,565 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 21:32:24,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:32:24,566 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-26 21:32:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:24,567 INFO L225 Difference]: With dead ends: 79 [2018-09-26 21:32:24,567 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 21:32:24,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:32:24,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 21:32:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-26 21:32:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 21:32:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 21:32:24,572 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-26 21:32:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:24,572 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 21:32:24,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 21:32:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 21:32:24,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 21:32:24,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:24,574 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-26 21:32:24,574 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:24,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:24,574 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-26 21:32:24,574 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:24,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:24,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:24,931 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:24,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:24,938 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:24,981 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-26 21:32:24,981 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:24,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:24,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:24,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:25,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:25,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:25,412 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:25,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:25,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-26 21:32:25,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 21:32:25,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 21:32:25,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:32:25,434 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-26 21:32:25,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:25,563 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 21:32:25,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:32:25,563 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-26 21:32:25,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:25,564 INFO L225 Difference]: With dead ends: 83 [2018-09-26 21:32:25,564 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 21:32:25,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:32:25,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 21:32:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-26 21:32:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 21:32:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 21:32:25,569 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-26 21:32:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:25,570 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 21:32:25,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 21:32:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 21:32:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 21:32:25,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:25,571 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-26 21:32:25,575 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:25,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:25,575 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-26 21:32:25,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:25,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:25,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:25,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:25,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:26,449 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:26,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:26,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:26,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:26,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:26,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:26,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:26,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:27,064 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:27,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:27,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-26 21:32:27,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 21:32:27,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 21:32:27,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:32:27,087 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-26 21:32:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:27,250 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 21:32:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:32:27,251 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-26 21:32:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:27,252 INFO L225 Difference]: With dead ends: 87 [2018-09-26 21:32:27,252 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 21:32:27,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:32:27,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 21:32:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-26 21:32:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 21:32:27,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 21:32:27,259 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-26 21:32:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:27,259 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 21:32:27,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 21:32:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 21:32:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 21:32:27,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:27,261 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-26 21:32:27,261 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:27,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:27,261 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-26 21:32:27,261 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:27,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:27,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:27,763 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:27,763 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:27,763 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:27,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:27,793 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:27,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:27,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:27,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:27,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:27,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:27,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:28,171 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:28,171 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-26 21:32:28,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 21:32:28,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 21:32:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:32:28,172 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-26 21:32:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:28,331 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 21:32:28,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:32:28,332 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-26 21:32:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:28,333 INFO L225 Difference]: With dead ends: 91 [2018-09-26 21:32:28,333 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 21:32:28,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:32:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 21:32:28,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-26 21:32:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 21:32:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 21:32:28,338 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-26 21:32:28,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:28,339 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 21:32:28,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 21:32:28,339 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 21:32:28,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 21:32:28,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:28,340 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-26 21:32:28,340 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:28,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:28,340 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-26 21:32:28,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:28,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:28,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:28,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:28,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:29,197 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:29,197 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:29,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:29,259 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-26 21:32:29,259 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:29,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:29,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:29,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:29,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:29,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:31,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:31,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-26 21:32:31,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 21:32:31,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 21:32:31,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:32:31,284 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-26 21:32:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:31,432 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 21:32:31,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:32:31,435 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-26 21:32:31,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:31,436 INFO L225 Difference]: With dead ends: 95 [2018-09-26 21:32:31,437 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 21:32:31,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:32:31,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 21:32:31,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-26 21:32:31,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 21:32:31,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 21:32:31,441 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-26 21:32:31,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:31,441 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 21:32:31,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 21:32:31,442 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 21:32:31,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 21:32:31,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:31,442 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-26 21:32:31,443 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:31,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:31,443 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-26 21:32:31,443 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:31,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:31,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:31,803 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:31,803 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:31,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:31,845 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:31,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:31,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:31,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:31,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:31,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:31,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:32,264 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:32,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:32,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-26 21:32:32,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 21:32:32,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 21:32:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:32:32,285 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-26 21:32:32,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:32,438 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 21:32:32,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:32:32,439 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-26 21:32:32,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:32,440 INFO L225 Difference]: With dead ends: 99 [2018-09-26 21:32:32,440 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 21:32:32,441 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:32:32,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 21:32:32,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-26 21:32:32,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 21:32:32,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 21:32:32,446 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-26 21:32:32,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:32,446 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 21:32:32,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 21:32:32,446 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 21:32:32,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 21:32:32,447 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:32,447 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-26 21:32:32,447 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:32,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:32,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-26 21:32:32,448 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:32,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:32,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:32,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:32,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:32,867 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:32,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:32,875 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:32,920 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-26 21:32:32,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:32,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:32,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:32,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:33,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:33,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:33,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:33,627 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:33,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-26 21:32:33,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:32:33,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:32:33,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:32:33,629 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-26 21:32:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:33,897 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 21:32:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 21:32:33,898 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-26 21:32:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:33,899 INFO L225 Difference]: With dead ends: 103 [2018-09-26 21:32:33,900 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 21:32:33,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:32:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 21:32:33,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-26 21:32:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 21:32:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 21:32:33,905 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-26 21:32:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:33,905 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 21:32:33,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:32:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 21:32:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 21:32:33,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:33,921 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-26 21:32:33,921 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:33,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-26 21:32:33,924 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:33,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:33,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:33,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:34,584 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:34,584 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:34,591 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:34,651 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-26 21:32:34,651 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:34,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:34,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:34,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:34,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:34,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:35,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:35,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:35,143 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-26 21:32:35,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 21:32:35,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 21:32:35,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:32:35,145 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-26 21:32:35,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:35,362 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 21:32:35,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:32:35,362 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-26 21:32:35,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:35,363 INFO L225 Difference]: With dead ends: 107 [2018-09-26 21:32:35,363 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 21:32:35,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:32:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 21:32:35,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-26 21:32:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 21:32:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 21:32:35,369 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-26 21:32:35,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:35,369 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 21:32:35,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 21:32:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 21:32:35,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 21:32:35,370 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:35,370 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-26 21:32:35,370 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:35,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:35,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-26 21:32:35,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:35,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:35,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:35,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:35,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:35,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:35,841 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:35,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:35,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:35,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:35,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:35,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:35,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:35,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:36,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:36,595 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:36,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-26 21:32:36,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 21:32:36,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 21:32:36,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 21:32:36,597 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-26 21:32:36,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:36,771 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 21:32:36,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:32:36,771 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-26 21:32:36,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:36,772 INFO L225 Difference]: With dead ends: 111 [2018-09-26 21:32:36,772 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 21:32:36,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 21:32:36,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 21:32:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-26 21:32:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:32:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 21:32:36,778 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-26 21:32:36,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:36,778 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 21:32:36,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 21:32:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 21:32:36,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 21:32:36,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:36,779 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-26 21:32:36,779 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:36,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:36,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-26 21:32:36,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:36,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:36,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:36,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:36,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:37,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:37,364 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:37,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:37,403 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:37,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:37,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:37,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:37,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:37,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:37,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:37,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:37,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-26 21:32:37,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 21:32:37,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 21:32:37,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:32:37,963 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-26 21:32:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:38,166 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 21:32:38,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:32:38,166 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-26 21:32:38,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:38,168 INFO L225 Difference]: With dead ends: 115 [2018-09-26 21:32:38,168 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 21:32:38,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:32:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 21:32:38,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-26 21:32:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 21:32:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 21:32:38,174 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-26 21:32:38,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:38,175 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 21:32:38,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 21:32:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 21:32:38,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 21:32:38,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:38,176 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-26 21:32:38,176 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:38,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:38,176 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-26 21:32:38,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:38,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:38,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:38,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:38,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:38,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:38,752 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:38,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:38,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:38,838 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-26 21:32:38,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:38,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:38,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:38,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:38,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:38,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:39,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:39,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-26 21:32:39,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 21:32:39,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 21:32:39,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:32:39,702 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-26 21:32:39,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:39,891 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 21:32:39,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:32:39,892 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-26 21:32:39,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:39,893 INFO L225 Difference]: With dead ends: 119 [2018-09-26 21:32:39,893 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 21:32:39,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:32:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 21:32:39,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-26 21:32:39,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 21:32:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 21:32:39,898 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-26 21:32:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:39,898 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 21:32:39,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 21:32:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 21:32:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 21:32:39,899 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:39,899 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-26 21:32:39,899 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:39,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:39,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-26 21:32:39,899 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:39,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:39,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:39,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:39,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:40,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:40,450 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:40,450 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:40,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:40,490 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:40,491 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:40,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:40,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:40,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:40,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:40,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:41,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:41,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-26 21:32:41,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 21:32:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 21:32:41,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 21:32:41,198 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-26 21:32:41,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:41,367 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 21:32:41,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:32:41,368 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-26 21:32:41,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:41,369 INFO L225 Difference]: With dead ends: 123 [2018-09-26 21:32:41,369 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 21:32:41,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 21:32:41,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 21:32:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-26 21:32:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 21:32:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 21:32:41,375 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-26 21:32:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:41,376 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 21:32:41,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 21:32:41,376 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 21:32:41,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 21:32:41,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:41,377 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-26 21:32:41,377 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:41,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:41,377 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-26 21:32:41,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:41,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:41,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:41,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:41,966 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:41,966 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:41,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:42,046 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-26 21:32:42,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:42,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:42,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:42,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:42,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:42,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:42,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:42,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-26 21:32:42,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 21:32:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 21:32:42,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:32:42,821 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-26 21:32:43,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:43,083 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 21:32:43,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:32:43,083 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-26 21:32:43,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:43,085 INFO L225 Difference]: With dead ends: 127 [2018-09-26 21:32:43,085 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 21:32:43,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:32:43,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 21:32:43,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-26 21:32:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 21:32:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 21:32:43,090 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-26 21:32:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:43,091 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 21:32:43,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 21:32:43,091 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 21:32:43,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 21:32:43,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:43,091 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-26 21:32:43,092 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:43,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-26 21:32:43,092 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:43,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:43,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:43,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:43,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:43,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:43,811 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:43,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:43,821 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:43,899 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-26 21:32:43,899 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:43,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:43,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:43,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:43,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:43,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:44,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:44,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-26 21:32:44,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 21:32:44,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 21:32:44,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:32:44,867 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-26 21:32:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:45,058 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 21:32:45,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 21:32:45,059 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-26 21:32:45,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:45,060 INFO L225 Difference]: With dead ends: 131 [2018-09-26 21:32:45,060 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 21:32:45,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:32:45,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 21:32:45,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-26 21:32:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 21:32:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 21:32:45,066 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-26 21:32:45,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:45,066 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 21:32:45,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 21:32:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 21:32:45,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 21:32:45,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:45,067 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-26 21:32:45,067 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:45,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:45,067 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-26 21:32:45,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:45,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:45,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:45,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:45,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:45,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:45,834 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:45,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:45,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:45,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:45,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:45,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:45,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:45,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:46,651 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:46,651 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-26 21:32:46,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 21:32:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 21:32:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:32:46,652 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-26 21:32:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:46,856 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 21:32:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 21:32:46,856 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-26 21:32:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:46,858 INFO L225 Difference]: With dead ends: 135 [2018-09-26 21:32:46,858 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 21:32:46,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:32:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 21:32:46,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-26 21:32:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 21:32:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 21:32:46,865 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-26 21:32:46,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:46,865 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 21:32:46,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 21:32:46,865 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 21:32:46,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 21:32:46,866 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:46,866 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-26 21:32:46,866 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:46,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:46,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-26 21:32:46,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:46,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:46,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:46,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:46,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:47,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:47,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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:47,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:47,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:47,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:47,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:47,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:47,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:47,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:47,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:48,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:48,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-26 21:32:48,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 21:32:48,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 21:32:48,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:32:48,753 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-26 21:32:48,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:48,974 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 21:32:48,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 21:32:48,974 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-26 21:32:48,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:48,976 INFO L225 Difference]: With dead ends: 139 [2018-09-26 21:32:48,976 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 21:32:48,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:32:48,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 21:32:48,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-26 21:32:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 21:32:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 21:32:48,983 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-26 21:32:48,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:48,983 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 21:32:48,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 21:32:48,983 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 21:32:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 21:32:48,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:48,984 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-26 21:32:48,984 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:48,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:48,985 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-26 21:32:48,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:48,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:48,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:49,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:49,889 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:49,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:49,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:50,070 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-26 21:32:50,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:50,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:50,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:50,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:50,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:50,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:52,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:52,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-26 21:32:52,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 21:32:52,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 21:32:52,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:32:52,544 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-26 21:32:52,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:52,850 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 21:32:52,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 21:32:52,851 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-26 21:32:52,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:52,852 INFO L225 Difference]: With dead ends: 143 [2018-09-26 21:32:52,852 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 21:32:52,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:32:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 21:32:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-26 21:32:52,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 21:32:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 21:32:52,859 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-26 21:32:52,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:52,859 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 21:32:52,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 21:32:52,859 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 21:32:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 21:32:52,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:52,860 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-26 21:32:52,860 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:52,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:52,861 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-26 21:32:52,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:52,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:52,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:52,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:53,599 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:53,600 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:53,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:53,645 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:53,645 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:53,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:53,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:53,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:53,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:53,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:54,717 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:54,717 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-26 21:32:54,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 21:32:54,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 21:32:54,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 21:32:54,718 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-26 21:32:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:55,111 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 21:32:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:32:55,112 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-26 21:32:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:55,113 INFO L225 Difference]: With dead ends: 147 [2018-09-26 21:32:55,113 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 21:32:55,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 21:32:55,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 21:32:55,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-26 21:32:55,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 21:32:55,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 21:32:55,119 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-26 21:32:55,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:55,119 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 21:32:55,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 21:32:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 21:32:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 21:32:55,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:55,121 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-26 21:32:55,121 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:55,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:55,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-26 21:32:55,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:55,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:55,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:55,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:55,965 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:55,965 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:55,975 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:56,068 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-26 21:32:56,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:56,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:56,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:56,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:56,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:56,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:57,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:57,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:57,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-26 21:32:57,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 21:32:57,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 21:32:57,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:32:57,030 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-26 21:32:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:57,419 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 21:32:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:32:57,419 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-26 21:32:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:57,421 INFO L225 Difference]: With dead ends: 151 [2018-09-26 21:32:57,421 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 21:32:57,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:32:57,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 21:32:57,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-26 21:32:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 21:32:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 21:32:57,427 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-26 21:32:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:57,427 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 21:32:57,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 21:32:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 21:32:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 21:32:57,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:57,428 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-26 21:32:57,429 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:57,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:57,429 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-26 21:32:57,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:57,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:57,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:57,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:58,287 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:58,287 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:58,407 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-26 21:32:58,407 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:58,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:58,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:58,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:58,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:58,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:59,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:59,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:59,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-26 21:32:59,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 21:32:59,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 21:32:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 21:32:59,371 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-26 21:32:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:59,788 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 21:32:59,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:32:59,789 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-26 21:32:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:59,790 INFO L225 Difference]: With dead ends: 155 [2018-09-26 21:32:59,790 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 21:32:59,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 21:32:59,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 21:32:59,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-26 21:32:59,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 21:32:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 21:32:59,796 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-26 21:32:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:59,797 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 21:32:59,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 21:32:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 21:32:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 21:32:59,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:59,798 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-26 21:32:59,798 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:59,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:59,798 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-26 21:32:59,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:59,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:59,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:59,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:01,052 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:01,052 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:01,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:01,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:01,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:01,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:01,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:01,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:02,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:02,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-26 21:33:02,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 21:33:02,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 21:33:02,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:33:02,141 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-26 21:33:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:02,413 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 21:33:02,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:33:02,414 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-26 21:33:02,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:02,415 INFO L225 Difference]: With dead ends: 159 [2018-09-26 21:33:02,415 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 21:33:02,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:33:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 21:33:02,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-26 21:33:02,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 21:33:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 21:33:02,420 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-26 21:33:02,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:02,420 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 21:33:02,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 21:33:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 21:33:02,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 21:33:02,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:02,421 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-26 21:33:02,421 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:02,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-26 21:33:02,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:02,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:02,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:03,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:03,317 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:03,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:03,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:03,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:03,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:03,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:03,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:03,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:03,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:04,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:04,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:04,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-26 21:33:04,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 21:33:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 21:33:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 21:33:04,495 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-26 21:33:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:04,836 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 21:33:04,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 21:33:04,836 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-26 21:33:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:04,837 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:33:04,837 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 21:33:04,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 21:33:04,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 21:33:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-26 21:33:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 21:33:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 21:33:04,843 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-26 21:33:04,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:04,843 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 21:33:04,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 21:33:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 21:33:04,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 21:33:04,844 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:04,845 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-26 21:33:04,845 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:04,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:04,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-26 21:33:04,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:04,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:04,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:04,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:06,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:06,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:06,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:06,978 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-26 21:33:06,978 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:06,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:06,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:06,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:06,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:06,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:08,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:08,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-26 21:33:08,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 21:33:08,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 21:33:08,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:33:08,030 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-26 21:33:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:08,305 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 21:33:08,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 21:33:08,306 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-26 21:33:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:08,307 INFO L225 Difference]: With dead ends: 167 [2018-09-26 21:33:08,307 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 21:33:08,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:33:08,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 21:33:08,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-26 21:33:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 21:33:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 21:33:08,312 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-26 21:33:08,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:08,313 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 21:33:08,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 21:33:08,313 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 21:33:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 21:33:08,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:08,314 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-26 21:33:08,314 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:08,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:08,314 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-26 21:33:08,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:08,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:08,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:08,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:09,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:09,639 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:09,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:09,692 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:09,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:09,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:09,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:09,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:09,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:09,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:11,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:11,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:11,057 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-26 21:33:11,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 21:33:11,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 21:33:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 21:33:11,059 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-26 21:33:11,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:11,505 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 21:33:11,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:33:11,506 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-26 21:33:11,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:11,507 INFO L225 Difference]: With dead ends: 171 [2018-09-26 21:33:11,507 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 21:33:11,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 21:33:11,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 21:33:11,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-26 21:33:11,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 21:33:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 21:33:11,513 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-26 21:33:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:11,514 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 21:33:11,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 21:33:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 21:33:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 21:33:11,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:11,515 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-26 21:33:11,515 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:11,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-26 21:33:11,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:11,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:11,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:11,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:13,015 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:13,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:13,030 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:13,187 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-26 21:33:13,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:13,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:13,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:13,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:13,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:13,295 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:14,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:14,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-26 21:33:14,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 21:33:14,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 21:33:14,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:33:14,453 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-26 21:33:14,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:14,775 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 21:33:14,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 21:33:14,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-26 21:33:14,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:14,777 INFO L225 Difference]: With dead ends: 175 [2018-09-26 21:33:14,777 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 21:33:14,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:33:14,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 21:33:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-26 21:33:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 21:33:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 21:33:14,784 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-26 21:33:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:14,784 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 21:33:14,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 21:33:14,784 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 21:33:14,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 21:33:14,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:14,785 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-26 21:33:14,786 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:14,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-26 21:33:14,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:14,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:16,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:16,278 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:16,294 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:16,483 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-26 21:33:16,484 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:16,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:16,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:16,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:16,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:16,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:17,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:17,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:17,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-26 21:33:17,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 21:33:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 21:33:17,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 21:33:17,718 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-26 21:33:18,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:18,317 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 21:33:18,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 21:33:18,317 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-26 21:33:18,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:18,318 INFO L225 Difference]: With dead ends: 179 [2018-09-26 21:33:18,319 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 21:33:18,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 21:33:18,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 21:33:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-26 21:33:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 21:33:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 21:33:18,324 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-26 21:33:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:18,324 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 21:33:18,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 21:33:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 21:33:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 21:33:18,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:18,325 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-26 21:33:18,326 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:18,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:18,326 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-26 21:33:18,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:18,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:18,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:18,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:18,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:19,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:19,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:19,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:19,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:19,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:19,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:19,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:19,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:20,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:20,955 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:20,955 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-26 21:33:20,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 21:33:20,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 21:33:20,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 21:33:20,957 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-26 21:33:21,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:21,235 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 21:33:21,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 21:33:21,235 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-26 21:33:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:21,237 INFO L225 Difference]: With dead ends: 183 [2018-09-26 21:33:21,237 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 21:33:21,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 21:33:21,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 21:33:21,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-26 21:33:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 21:33:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 21:33:21,243 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-26 21:33:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:21,243 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 21:33:21,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 21:33:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 21:33:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 21:33:21,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:21,245 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-26 21:33:21,245 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:21,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-26 21:33:21,245 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:21,246 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:21,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:22,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:22,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:22,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:22,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:22,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:22,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:22,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:22,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:22,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:22,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:22,634 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:24,046 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:24,046 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-26 21:33:24,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 21:33:24,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 21:33:24,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:33:24,048 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-26 21:33:24,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:24,330 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 21:33:24,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:33:24,330 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-26 21:33:24,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:24,332 INFO L225 Difference]: With dead ends: 187 [2018-09-26 21:33:24,332 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 21:33:24,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:33:24,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 21:33:24,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-26 21:33:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 21:33:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 21:33:24,339 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-26 21:33:24,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:24,339 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 21:33:24,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 21:33:24,339 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 21:33:24,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 21:33:24,340 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:24,340 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-26 21:33:24,340 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:24,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:24,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-26 21:33:24,341 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:24,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:24,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:24,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:24,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:26,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:26,035 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:26,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:26,044 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:26,209 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-26 21:33:26,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:26,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:26,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:26,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:26,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:26,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:27,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:27,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:27,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-26 21:33:27,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 21:33:27,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 21:33:27,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:33:27,565 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-26 21:33:27,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:27,865 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 21:33:27,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:33:27,866 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-26 21:33:27,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:27,868 INFO L225 Difference]: With dead ends: 191 [2018-09-26 21:33:27,868 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 21:33:27,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:33:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 21:33:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-26 21:33:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 21:33:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 21:33:27,874 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-26 21:33:27,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:27,874 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 21:33:27,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 21:33:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 21:33:27,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 21:33:27,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:27,875 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-26 21:33:27,875 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:27,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-26 21:33:27,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:27,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:27,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:27,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:27,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:27,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:29,276 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:29,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:29,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:29,335 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:29,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:29,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:29,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:29,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:29,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:29,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:31,780 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:31,781 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-26 21:33:31,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 21:33:31,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 21:33:31,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 21:33:31,782 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-26 21:33:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:32,239 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 21:33:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:33:32,239 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-26 21:33:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:32,241 INFO L225 Difference]: With dead ends: 195 [2018-09-26 21:33:32,241 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 21:33:32,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 21:33:32,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 21:33:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-26 21:33:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 21:33:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 21:33:32,246 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-26 21:33:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:32,246 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 21:33:32,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 21:33:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 21:33:32,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 21:33:32,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:32,248 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-26 21:33:32,248 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:32,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-26 21:33:32,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:32,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:32,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:33,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:33,417 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:33,417 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:33,424 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:33,547 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-26 21:33:33,547 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:33,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:33,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:33,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:33,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:33,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:35,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:35,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:35,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-26 21:33:35,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 21:33:35,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 21:33:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:33:35,139 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-26 21:33:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:35,599 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 21:33:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 21:33:35,599 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-26 21:33:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:35,600 INFO L225 Difference]: With dead ends: 199 [2018-09-26 21:33:35,600 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 21:33:35,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:33:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 21:33:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-26 21:33:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 21:33:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 21:33:35,605 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-26 21:33:35,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:35,606 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 21:33:35,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 21:33:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 21:33:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 21:33:35,606 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:35,607 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-26 21:33:35,607 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:35,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-26 21:33:35,607 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:35,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:35,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:37,015 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:37,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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:37,021 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:37,169 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-26 21:33:37,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:37,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:37,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:37,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:37,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:37,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:38,694 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:38,694 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-26 21:33:38,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 21:33:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 21:33:38,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:33:38,696 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-26 21:33:39,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:39,072 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 21:33:39,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:33:39,072 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-26 21:33:39,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:39,074 INFO L225 Difference]: With dead ends: 203 [2018-09-26 21:33:39,074 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 21:33:39,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:33:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 21:33:39,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-26 21:33:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 21:33:39,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 21:33:39,080 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-26 21:33:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:39,080 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 21:33:39,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 21:33:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 21:33:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 21:33:39,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:39,081 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-26 21:33:39,081 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:39,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:39,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-26 21:33:39,082 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:39,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:39,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:39,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:40,490 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:40,491 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-09-26 21:33:40,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:40,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:40,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:40,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:40,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:40,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:42,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:42,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-26 21:33:42,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 21:33:42,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 21:33:42,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:33:42,271 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-26 21:33:42,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:42,590 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 21:33:42,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:33:42,591 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-26 21:33:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:42,592 INFO L225 Difference]: With dead ends: 207 [2018-09-26 21:33:42,592 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 21:33:42,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:33:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 21:33:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-26 21:33:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 21:33:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 21:33:42,598 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-26 21:33:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:42,599 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 21:33:42,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 21:33:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 21:33:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 21:33:42,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:42,600 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-26 21:33:42,600 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:42,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-26 21:33:42,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:42,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:42,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:42,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:42,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:43,946 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:43,946 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:43,946 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-09-26 21:33:43,956 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:44,008 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:44,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:44,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:44,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:44,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:44,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:44,023 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:46,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:46,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-26 21:33:46,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 21:33:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 21:33:46,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 21:33:46,286 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-26 21:33:46,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:46,604 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 21:33:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:33:46,605 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-26 21:33:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:46,607 INFO L225 Difference]: With dead ends: 211 [2018-09-26 21:33:46,607 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 21:33:46,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 21:33:46,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 21:33:46,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-26 21:33:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 21:33:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 21:33:46,615 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-26 21:33:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:46,615 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 21:33:46,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 21:33:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 21:33:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 21:33:46,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:46,617 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-26 21:33:46,617 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:46,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:46,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-26 21:33:46,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:46,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:46,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:46,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:46,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:48,018 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:48,018 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-09-26 21:33:48,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:48,393 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-26 21:33:48,393 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:48,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:48,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:48,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:48,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:48,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:50,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:50,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-26 21:33:50,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 21:33:50,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 21:33:50,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:33:50,089 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-26 21:33:50,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:50,439 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 21:33:50,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 21:33:50,439 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-26 21:33:50,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:50,441 INFO L225 Difference]: With dead ends: 215 [2018-09-26 21:33:50,441 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 21:33:50,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:33:50,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 21:33:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-26 21:33:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:33:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 21:33:50,448 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-26 21:33:50,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:50,448 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 21:33:50,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 21:33:50,448 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 21:33:50,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 21:33:50,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:50,450 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-26 21:33:50,450 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:50,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:50,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-26 21:33:50,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:50,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:50,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:50,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:50,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:52,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:52,188 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-09-26 21:33:52,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:52,253 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:52,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:52,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:52,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:52,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:52,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:52,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:54,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:54,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:54,083 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-26 21:33:54,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 21:33:54,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 21:33:54,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 21:33:54,085 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-26 21:33:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:54,449 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 21:33:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:33:54,450 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-26 21:33:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:54,451 INFO L225 Difference]: With dead ends: 219 [2018-09-26 21:33:54,452 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 21:33:54,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 21:33:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 21:33:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-26 21:33:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 21:33:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 21:33:54,458 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-26 21:33:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:54,458 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 21:33:54,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 21:33:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 21:33:54,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 21:33:54,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:54,459 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-26 21:33:54,459 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:54,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-26 21:33:54,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:54,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:54,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:54,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:56,411 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:56,411 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:33:56,421 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:56,559 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-26 21:33:56,560 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:56,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:56,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:56,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:56,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:56,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:58,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:58,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-26 21:33:58,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 21:33:58,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 21:33:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:33:58,348 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-26 21:33:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:58,711 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-26 21:33:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:33:58,711 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-26 21:33:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:58,713 INFO L225 Difference]: With dead ends: 223 [2018-09-26 21:33:58,713 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 21:33:58,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:33:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 21:33:58,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-26 21:33:58,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 21:33:58,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 21:33:58,718 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-26 21:33:58,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:58,718 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 21:33:58,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 21:33:58,718 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 21:33:58,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 21:33:58,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:58,719 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-26 21:33:58,719 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:58,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-26 21:33:58,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:58,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:58,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:58,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:00,211 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:00,211 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-09-26 21:34:00,218 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:34:00,402 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-26 21:34:00,402 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:00,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:00,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:00,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:00,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:00,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:02,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:02,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:02,611 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-26 21:34:02,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 21:34:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 21:34:02,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 21:34:02,612 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-26 21:34:02,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:02,939 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 21:34:02,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 21:34:02,940 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-26 21:34:02,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:02,941 INFO L225 Difference]: With dead ends: 227 [2018-09-26 21:34:02,941 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 21:34:02,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 21:34:02,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 21:34:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-26 21:34:02,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 21:34:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 21:34:02,948 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-26 21:34:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:02,948 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 21:34:02,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 21:34:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 21:34:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 21:34:02,949 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:02,950 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-26 21:34:02,950 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:02,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:02,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-26 21:34:02,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:02,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:02,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:02,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:02,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:04,573 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:04,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:04,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 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-09-26 21:34:04,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:04,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:04,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:04,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:04,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:04,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:04,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:06,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:06,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:06,778 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-26 21:34:06,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 21:34:06,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 21:34:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 21:34:06,779 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-26 21:34:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:07,175 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 21:34:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 21:34:07,176 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-26 21:34:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:07,177 INFO L225 Difference]: With dead ends: 231 [2018-09-26 21:34:07,177 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 21:34:07,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 21:34:07,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 21:34:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-26 21:34:07,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 21:34:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 21:34:07,184 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-26 21:34:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:07,184 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 21:34:07,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 21:34:07,184 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 21:34:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 21:34:07,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:07,186 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-26 21:34:07,186 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:07,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-26 21:34:07,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:07,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:07,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:07,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:08,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:08,786 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-09-26 21:34:08,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:34:08,862 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:34:08,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:08,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:08,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:08,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:08,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:08,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:11,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:11,354 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-26 21:34:11,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 21:34:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 21:34:11,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:34:11,356 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-26 21:34:11,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:11,809 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 21:34:11,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 21:34:11,809 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-26 21:34:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:11,811 INFO L225 Difference]: With dead ends: 235 [2018-09-26 21:34:11,811 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 21:34:11,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:34:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 21:34:11,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-26 21:34:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 21:34:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 21:34:11,816 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-26 21:34:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:11,817 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 21:34:11,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 21:34:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 21:34:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 21:34:11,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:11,818 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-26 21:34:11,818 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:11,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-26 21:34:11,819 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:11,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:11,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:11,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:11,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:13,522 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:13,522 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:13,522 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-09-26 21:34:13,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:34:13,782 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-26 21:34:13,782 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:13,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:13,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:13,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:13,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:13,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:16,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:16,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-26 21:34:16,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 21:34:16,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 21:34:16,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:34:16,039 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-26 21:34:16,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:16,489 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-26 21:34:16,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 21:34:16,490 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-26 21:34:16,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:16,491 INFO L225 Difference]: With dead ends: 239 [2018-09-26 21:34:16,491 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 21:34:16,491 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:34:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 21:34:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-26 21:34:16,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 21:34:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 21:34:16,496 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-26 21:34:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:16,496 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 21:34:16,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 21:34:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 21:34:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 21:34:16,497 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:16,497 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-26 21:34:16,497 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:16,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:16,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-26 21:34:16,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:16,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:16,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:16,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:16,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:18,275 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:18,275 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-09-26 21:34:18,284 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:18,351 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:18,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:18,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:18,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:18,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:18,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:18,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:20,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:20,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-26 21:34:20,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 21:34:20,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 21:34:20,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 21:34:20,446 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-26 21:34:20,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:20,868 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-26 21:34:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 21:34:20,869 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-26 21:34:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:20,870 INFO L225 Difference]: With dead ends: 243 [2018-09-26 21:34:20,871 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 21:34:20,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 21:34:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 21:34:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-26 21:34:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 21:34:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 21:34:20,875 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-26 21:34:20,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:20,876 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 21:34:20,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 21:34:20,876 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 21:34:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 21:34:20,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:20,877 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-26 21:34:20,877 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:20,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-26 21:34:20,877 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:20,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:20,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:20,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:22,909 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:22,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 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-09-26 21:34:22,918 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:23,080 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-26 21:34:23,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:23,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:23,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:23,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:23,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:23,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:25,271 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:25,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-26 21:34:25,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 21:34:25,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 21:34:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 21:34:25,274 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-26 21:34:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:25,647 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-26 21:34:25,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 21:34:25,647 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-26 21:34:25,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:25,649 INFO L225 Difference]: With dead ends: 247 [2018-09-26 21:34:25,649 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 21:34:25,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 21:34:25,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 21:34:25,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-26 21:34:25,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 21:34:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 21:34:25,656 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-26 21:34:25,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:25,656 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 21:34:25,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 21:34:25,656 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 21:34:25,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 21:34:25,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:25,658 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-26 21:34:25,658 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:25,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:25,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-26 21:34:25,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:25,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:25,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:25,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:25,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:27,791 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:27,792 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:27,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 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-09-26 21:34:27,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:34:28,017 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-26 21:34:28,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:28,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:28,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:28,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:28,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:28,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:30,227 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:30,227 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-26 21:34:30,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 21:34:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 21:34:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 21:34:30,229 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-26 21:34:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:30,720 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-26 21:34:30,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 21:34:30,721 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-26 21:34:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:30,722 INFO L225 Difference]: With dead ends: 251 [2018-09-26 21:34:30,722 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 21:34:30,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 21:34:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 21:34:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-26 21:34:30,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 21:34:30,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-26 21:34:30,730 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-26 21:34:30,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:30,731 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-26 21:34:30,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 21:34:30,731 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-26 21:34:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 21:34:30,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:30,732 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-26 21:34:30,732 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:30,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-26 21:34:30,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:30,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:30,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:30,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:32,944 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:32,944 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-09-26 21:34:32,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:33,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:33,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:33,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:33,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:33,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:35,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:35,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:35,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-26 21:34:35,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 21:34:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 21:34:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 21:34:35,406 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-26 21:34:35,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:35,837 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 21:34:35,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 21:34:35,837 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-26 21:34:35,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:35,839 INFO L225 Difference]: With dead ends: 255 [2018-09-26 21:34:35,839 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 21:34:35,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 21:34:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 21:34:35,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-26 21:34:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 21:34:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-26 21:34:35,844 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-26 21:34:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:35,844 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-26 21:34:35,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 21:34:35,844 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-26 21:34:35,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 21:34:35,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:35,845 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-26 21:34:35,845 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:35,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-26 21:34:35,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:35,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:35,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:35,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:38,007 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:38,007 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:38,007 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-09-26 21:34:38,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:34:38,077 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:34:38,078 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:38,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:38,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:38,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:38,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:38,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:40,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:40,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-26 21:34:40,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 21:34:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 21:34:40,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 21:34:40,502 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-26 21:34:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:40,951 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-26 21:34:40,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 21:34:40,951 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-26 21:34:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:40,953 INFO L225 Difference]: With dead ends: 259 [2018-09-26 21:34:40,953 INFO L226 Difference]: Without dead ends: 258 [2018-09-26 21:34:40,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 21:34:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-26 21:34:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-26 21:34:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 21:34:40,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 21:34:40,958 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-26 21:34:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:40,958 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 21:34:40,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 21:34:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 21:34:40,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 21:34:40,959 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:40,959 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-26 21:34:40,960 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:40,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:40,960 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-26 21:34:40,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:40,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:40,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:43,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:43,333 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-09-26 21:34:43,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:34:43,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-26 21:34:43,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:43,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:43,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:43,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:43,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:43,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:46,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:46,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-26 21:34:46,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 21:34:46,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 21:34:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 21:34:46,156 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-26 21:34:46,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:46,625 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-26 21:34:46,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 21:34:46,626 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-26 21:34:46,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:46,628 INFO L225 Difference]: With dead ends: 263 [2018-09-26 21:34:46,628 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 21:34:46,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 21:34:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 21:34:46,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-26 21:34:46,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 21:34:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-26 21:34:46,633 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-26 21:34:46,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:46,634 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-26 21:34:46,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 21:34:46,634 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-26 21:34:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 21:34:46,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:46,635 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-26 21:34:46,635 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:46,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:46,635 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-26 21:34:46,635 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:46,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:46,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:46,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:48,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:48,998 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-09-26 21:34:49,022 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:49,093 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:49,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:49,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:49,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:49,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:49,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:49,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:51,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:51,890 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:51,890 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-26 21:34:51,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 21:34:51,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 21:34:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:34:51,892 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-26 21:34:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:52,433 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-26 21:34:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 21:34:52,434 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-26 21:34:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:52,435 INFO L225 Difference]: With dead ends: 267 [2018-09-26 21:34:52,435 INFO L226 Difference]: Without dead ends: 266 [2018-09-26 21:34:52,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:34:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-26 21:34:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-26 21:34:52,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 21:34:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-26 21:34:52,442 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-26 21:34:52,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:52,442 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-26 21:34:52,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 21:34:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-26 21:34:52,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 21:34:52,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:52,444 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-26 21:34:52,444 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:52,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:52,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-26 21:34:52,444 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:52,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:52,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:52,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:52,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:54,632 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:54,632 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-09-26 21:34:54,639 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:54,832 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-26 21:34:54,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:54,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:54,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:54,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:54,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:54,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:57,455 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:57,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:57,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-26 21:34:57,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 21:34:57,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 21:34:57,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 21:34:57,478 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-26 21:34:57,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:57,980 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-26 21:34:57,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 21:34:57,981 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-26 21:34:57,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:57,982 INFO L225 Difference]: With dead ends: 271 [2018-09-26 21:34:57,983 INFO L226 Difference]: Without dead ends: 270 [2018-09-26 21:34:57,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 21:34:57,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-26 21:34:57,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-26 21:34:57,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 21:34:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-26 21:34:57,988 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-26 21:34:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:57,988 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-26 21:34:57,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 21:34:57,988 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-26 21:34:57,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 21:34:57,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:57,990 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-26 21:34:57,990 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:57,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:57,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-26 21:34:57,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:57,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:57,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:57,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:57,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:00,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:00,184 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:00,184 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-09-26 21:35:00,192 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:35:00,449 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-26 21:35:00,449 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:00,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:00,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:00,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:00,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:00,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:03,404 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:03,404 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-26 21:35:03,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 21:35:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 21:35:03,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 21:35:03,406 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-26 21:35:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:03,949 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-26 21:35:03,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 21:35:03,950 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-26 21:35:03,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:03,951 INFO L225 Difference]: With dead ends: 275 [2018-09-26 21:35:03,952 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 21:35:03,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 21:35:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 21:35:03,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-26 21:35:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 21:35:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-26 21:35:03,957 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-26 21:35:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:03,957 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-26 21:35:03,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 21:35:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-26 21:35:03,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 21:35:03,958 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:03,958 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-26 21:35:03,959 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:03,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:03,959 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-26 21:35:03,959 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:03,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:03,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:03,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:03,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:06,222 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:06,222 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-09-26 21:35:06,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:06,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:06,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:06,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:06,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:06,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:09,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:09,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-26 21:35:09,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 21:35:09,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 21:35:09,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 21:35:09,351 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-26 21:35:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:09,773 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-26 21:35:09,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 21:35:09,774 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-26 21:35:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:09,775 INFO L225 Difference]: With dead ends: 279 [2018-09-26 21:35:09,775 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 21:35:09,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 21:35:09,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 21:35:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-26 21:35:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 21:35:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-26 21:35:09,783 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-26 21:35:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:09,783 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-26 21:35:09,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 21:35:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-26 21:35:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 21:35:09,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:09,785 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-26 21:35:09,785 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:09,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-26 21:35:09,785 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:09,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:09,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:12,116 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:12,116 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:12,116 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-09-26 21:35:12,122 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:35:12,190 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:35:12,190 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:12,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:12,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:12,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:12,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:12,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:15,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:15,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-26 21:35:15,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 21:35:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 21:35:15,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 21:35:15,258 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-26 21:35:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:15,766 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-26 21:35:15,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 21:35:15,767 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-26 21:35:15,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:15,769 INFO L225 Difference]: With dead ends: 283 [2018-09-26 21:35:15,769 INFO L226 Difference]: Without dead ends: 282 [2018-09-26 21:35:15,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 21:35:15,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-26 21:35:15,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-26 21:35:15,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 21:35:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 21:35:15,776 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-26 21:35:15,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:15,776 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 21:35:15,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 21:35:15,776 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 21:35:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 21:35:15,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:15,778 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-26 21:35:15,778 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:15,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-26 21:35:15,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:15,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:15,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:15,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:18,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:18,394 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-09-26 21:35:18,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:35:18,771 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-26 21:35:18,771 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:18,779 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:18,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:18,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:18,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:18,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:21,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:21,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-26 21:35:21,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 21:35:21,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 21:35:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 21:35:21,701 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-26 21:35:22,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:22,157 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-26 21:35:22,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 21:35:22,157 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-26 21:35:22,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:22,159 INFO L225 Difference]: With dead ends: 287 [2018-09-26 21:35:22,159 INFO L226 Difference]: Without dead ends: 286 [2018-09-26 21:35:22,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 21:35:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-26 21:35:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-26 21:35:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 21:35:22,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-26 21:35:22,165 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-26 21:35:22,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:22,165 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-26 21:35:22,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 21:35:22,165 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-26 21:35:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 21:35:22,166 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:22,166 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-26 21:35:22,166 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:22,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:22,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-26 21:35:22,167 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:22,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:22,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:22,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:22,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:24,930 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:24,930 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-26 21:35:24,936 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:35:25,020 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:35:25,020 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:25,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:25,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:25,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:25,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:25,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:28,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:28,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-26 21:35:28,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 21:35:28,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 21:35:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 21:35:28,071 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-26 21:35:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:28,721 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-26 21:35:28,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 21:35:28,722 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-26 21:35:28,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:28,724 INFO L225 Difference]: With dead ends: 291 [2018-09-26 21:35:28,724 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 21:35:28,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 21:35:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 21:35:28,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-26 21:35:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 21:35:28,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-26 21:35:28,729 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-26 21:35:28,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:28,729 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-26 21:35:28,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 21:35:28,730 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-26 21:35:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 21:35:28,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:28,731 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-26 21:35:28,731 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:28,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:28,731 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-26 21:35:28,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:28,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:28,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:28,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:31,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:31,317 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-09-26 21:35:31,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:35:31,541 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-26 21:35:31,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:31,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:31,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:31,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:31,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:31,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:34,790 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:34,790 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-26 21:35:34,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 21:35:34,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 21:35:34,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 21:35:34,793 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-26 21:35:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:35,319 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-26 21:35:35,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 21:35:35,319 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-26 21:35:35,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:35,321 INFO L225 Difference]: With dead ends: 295 [2018-09-26 21:35:35,321 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 21:35:35,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 21:35:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 21:35:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-26 21:35:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 21:35:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-26 21:35:35,328 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-26 21:35:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:35,328 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-26 21:35:35,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 21:35:35,328 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-26 21:35:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 21:35:35,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:35,329 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-26 21:35:35,330 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:35,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:35,330 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-26 21:35:35,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:35,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:35,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:35,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:37,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:37,933 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:37,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 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-09-26 21:35:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:35:38,256 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-26 21:35:38,256 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:38,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:38,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:38,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:38,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:38,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:41,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:41,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-26 21:35:41,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 21:35:41,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 21:35:41,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 21:35:41,515 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-26 21:35:42,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:42,004 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-26 21:35:42,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 21:35:42,004 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-26 21:35:42,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:42,006 INFO L225 Difference]: With dead ends: 299 [2018-09-26 21:35:42,006 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 21:35:42,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 21:35:42,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 21:35:42,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-26 21:35:42,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 21:35:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-26 21:35:42,011 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-26 21:35:42,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:42,012 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-26 21:35:42,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 21:35:42,012 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-26 21:35:42,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 21:35:42,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:42,013 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-26 21:35:42,014 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:42,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:42,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-26 21:35:42,014 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:42,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:42,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:42,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:44,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:44,942 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:44,942 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-09-26 21:35:44,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:45,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:45,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:45,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:45,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:45,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:48,231 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:48,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-26 21:35:48,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 21:35:48,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 21:35:48,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 21:35:48,233 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-26 21:35:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:48,797 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-26 21:35:48,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 21:35:48,798 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-26 21:35:48,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:48,800 INFO L225 Difference]: With dead ends: 303 [2018-09-26 21:35:48,800 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 21:35:48,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 21:35:48,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 21:35:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-26 21:35:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 21:35:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-26 21:35:48,807 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-26 21:35:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:48,808 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-26 21:35:48,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 21:35:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-26 21:35:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 21:35:48,809 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:48,810 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-26 21:35:48,810 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:48,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-26 21:35:48,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:48,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:48,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:48,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:51,491 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:51,491 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-09-26 21:35:51,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:35:51,570 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:35:51,570 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:51,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:51,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:51,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:51,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:51,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:54,870 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:54,870 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-26 21:35:54,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 21:35:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 21:35:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 21:35:54,872 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-26 21:35:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:55,363 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-26 21:35:55,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 21:35:55,363 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-26 21:35:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:55,365 INFO L225 Difference]: With dead ends: 307 [2018-09-26 21:35:55,365 INFO L226 Difference]: Without dead ends: 306 [2018-09-26 21:35:55,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 21:35:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-26 21:35:55,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-26 21:35:55,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 21:35:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-26 21:35:55,370 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-26 21:35:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:55,371 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-26 21:35:55,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 21:35:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-26 21:35:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 21:35:55,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:55,372 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-26 21:35:55,372 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:55,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:55,372 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-26 21:35:55,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:55,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:55,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:55,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:58,078 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:58,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 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-09-26 21:35:58,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:35:58,515 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-26 21:35:58,515 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:58,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:58,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:58,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:58,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:58,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:36:01,845 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:01,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:36:01,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-09-26 21:36:01,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 21:36:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 21:36:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 21:36:01,868 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-26 21:36:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:36:02,389 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-26 21:36:02,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 21:36:02,390 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-09-26 21:36:02,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:36:02,392 INFO L225 Difference]: With dead ends: 311 [2018-09-26 21:36:02,392 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 21:36:02,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 21:36:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 21:36:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-09-26 21:36:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 21:36:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-26 21:36:02,398 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-09-26 21:36:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:36:02,398 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-26 21:36:02,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 21:36:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-26 21:36:02,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 21:36:02,399 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:36:02,399 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-09-26 21:36:02,399 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:36:02,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:36:02,400 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-09-26 21:36:02,400 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:36:02,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:36:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:02,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:36:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:36:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:05,260 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:36:05,260 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-09-26 21:36:05,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:36:05,355 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:36:05,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:36:05,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:36:05,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:36:05,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:36:05,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:36:05,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:36:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:08,726 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:36:08,726 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 154 [2018-09-26 21:36:08,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 21:36:08,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 21:36:08,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 21:36:08,729 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 156 states. [2018-09-26 21:36:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:36:09,297 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-09-26 21:36:09,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 21:36:09,297 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 308 [2018-09-26 21:36:09,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:36:09,299 INFO L225 Difference]: With dead ends: 315 [2018-09-26 21:36:09,299 INFO L226 Difference]: Without dead ends: 314 [2018-09-26 21:36:09,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11704 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 21:36:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-26 21:36:09,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 313. [2018-09-26 21:36:09,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 21:36:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-09-26 21:36:09,305 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 308 [2018-09-26 21:36:09,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:36:09,305 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-09-26 21:36:09,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 21:36:09,305 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-09-26 21:36:09,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 21:36:09,306 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:36:09,306 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 1, 1] [2018-09-26 21:36:09,307 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:36:09,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:36:09,307 INFO L82 PathProgramCache]: Analyzing trace with hash 2140213899, now seen corresponding path program 77 times [2018-09-26 21:36:09,307 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:36:09,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:36:09,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:09,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:36:09,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 21:36:10,157 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:36:10,268 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:36:10,269 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:36:10 BoogieIcfgContainer [2018-09-26 21:36:10,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:36:10,270 INFO L168 Benchmark]: Toolchain (without parser) took 240574.18 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.1 MB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -856.3 MB). Peak memory consumption was 102.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:36:10,271 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:10,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:10,272 INFO L168 Benchmark]: Boogie Preprocessor took 32.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:10,272 INFO L168 Benchmark]: RCFGBuilder took 301.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:36:10,272 INFO L168 Benchmark]: TraceAbstraction took 240166.43 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -877.4 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. [2018-09-26 21:36:10,274 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.21 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 65.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.61 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 301.87 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240166.43 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 833.1 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -877.4 MB). Peak memory consumption was 81.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 313 with TraceHistMax 78, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 41 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 240.0s OverallTime, 78 OverallIterations, 78 TraceHistogramMax, 24.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 4310 SDslu, 4403 SDs, 0 SdLazy, 16366 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14935 GetRequests, 8930 SyntacticMatches, 0 SemanticMatches, 6005 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304304 ImplicationChecksByTransitivity, 186.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=77, 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: 0.4s AutomataMinimizationTime, 77 MinimizatonAttempts, 77 StatesRemovedByMinimization, 77 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 199.1s InterpolantComputationTime, 24020 NumberOfCodeBlocks, 24020 NumberOfCodeBlocksAsserted, 1610 NumberOfCheckSat, 23867 ConstructedInterpolants, 0 QuantifiedInterpolants, 39336447 SizeOfPredicates, 456 NumberOfNonLiveVariables, 22230 ConjunctsInSsa, 9538 ConjunctsInUnsatCore, 153 InterpolantComputations, 1 PerfectInterpolantSequences, 0/602756 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/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-36-10-283.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-36-10-283.csv Completed graceful shutdown