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-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:34:18,410 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:34:18,412 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:34:18,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:34:18,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:34:18,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:34:18,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:34:18,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:34:18,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:34:18,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:34:18,436 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:34:18,437 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:34:18,438 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:34:18,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:34:18,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:34:18,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:34:18,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:34:18,451 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:34:18,456 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:34:18,458 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:34:18,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:34:18,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:34:18,467 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:34:18,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:34:18,468 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:34:18,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:34:18,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:34:18,473 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:34:18,477 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:34:18,478 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:34:18,478 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:34:18,479 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:34:18,479 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:34:18,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:34:18,481 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:34:18,482 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:34:18,482 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-30 10:34:18,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:34:18,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:34:18,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:34:18,504 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:34:18,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:34:18,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:34:18,506 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:34:18,507 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:34:18,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:34:18,508 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:34:18,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:34:18,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:34:18,508 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:34:18,508 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:34:18,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:34:18,509 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:34:18,509 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:34:18,509 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:34:18,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:34:18,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:34:18,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:34:18,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:34:18,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:34:18,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:34:18,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:34:18,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:34:18,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:34:18,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:34:18,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:34:18,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:34:18,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:34:18,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:34:18,594 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:34:18,596 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:34:18,596 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:34:18,597 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-09-30 10:34:18,598 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-09-30 10:34:18,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:34:18,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:34:18,657 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:34:18,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:34:18,658 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:34:18,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,700 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:34:18,701 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:34:18,701 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:34:18,716 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:34:18,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:34:18,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:34:18,718 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:34:18,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,731 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,731 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... [2018-09-30 10:34:18,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:34:18,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:34:18,746 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:34:18,746 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:34:18,747 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:34:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 10:34:18,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 10:34:18,824 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-30 10:34:19,070 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:34:19,071 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:19 BoogieIcfgContainer [2018-09-30 10:34:19,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:34:19,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:34:19,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:34:19,084 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:34:19,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:34:18" (1/2) ... [2018-09-30 10:34:19,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1202ea0f and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:34:19, skipping insertion in model container [2018-09-30 10:34:19,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:34:19" (2/2) ... [2018-09-30 10:34:19,091 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-09-30 10:34:19,111 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:34:19,125 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:34:19,207 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:34:19,209 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:34:19,209 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:34:19,209 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:34:19,209 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:34:19,209 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:34:19,210 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:34:19,210 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:34:19,210 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:34:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-30 10:34:19,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:34:19,234 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:19,235 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-30 10:34:19,236 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:19,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:19,245 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-30 10:34:19,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:19,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:19,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:19,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:19,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:19,462 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:34:19,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 10:34:19,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:34:19,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:34:19,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-30 10:34:19,480 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-30 10:34:19,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:19,527 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-30 10:34:19,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:34:19,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-30 10:34:19,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:19,541 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:34:19,541 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 10:34:19,545 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-30 10:34:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 10:34:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-30 10:34:19,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:34:19,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 10:34:19,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-30 10:34:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:19,577 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 10:34:19,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:34:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 10:34:19,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:34:19,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:19,578 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-30 10:34:19,579 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:19,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:19,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-30 10:34:19,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:19,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:19,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:19,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:19,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:19,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:19,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:19,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:19,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:19,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:19,775 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-30 10:34:19,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:19,822 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-30 10:34:19,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:19,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:19,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-30 10:34:19,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:34:19,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:34:19,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:34:19,984 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-30 10:34:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:20,080 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 10:34:20,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:34:20,081 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-30 10:34:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:20,083 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:34:20,083 INFO L226 Difference]: Without dead ends: 14 [2018-09-30 10:34:20,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 10:34:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-30 10:34:20,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-30 10:34:20,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:34:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 10:34:20,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-30 10:34:20,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:20,089 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 10:34:20,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:34:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 10:34:20,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:34:20,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:20,090 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-30 10:34:20,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:20,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:20,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-30 10:34:20,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:20,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:20,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:20,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:20,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:20,219 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:20,219 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:20,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:20,278 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:20,278 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:20,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:20,307 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-30 10:34:20,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:20,425 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-30 10:34:20,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:34:20,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:20,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-30 10:34:20,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:34:20,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:34:20,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-30 10:34:20,596 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-30 10:34:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:20,706 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 10:34:20,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:34:20,707 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-30 10:34:20,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:20,707 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:34:20,708 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 10:34:20,708 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-30 10:34:20,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 10:34:20,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-30 10:34:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:34:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 10:34:20,713 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-30 10:34:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:20,717 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 10:34:20,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:34:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 10:34:20,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:34:20,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:20,718 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-30 10:34:20,719 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:20,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:20,720 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-30 10:34:20,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:20,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:20,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:20,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:20,868 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-30 10:34:20,868 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:20,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:20,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:20,951 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-30 10:34:20,952 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:20,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:20,980 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-30 10:34:20,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:20,993 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-30 10:34:20,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:21,083 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-30 10:34:21,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:21,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-30 10:34:21,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:34:21,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:34:21,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-30 10:34:21,109 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-30 10:34:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:21,193 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-30 10:34:21,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:34:21,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 10:34:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:21,195 INFO L225 Difference]: With dead ends: 23 [2018-09-30 10:34:21,195 INFO L226 Difference]: Without dead ends: 22 [2018-09-30 10:34:21,196 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-30 10:34:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-30 10:34:21,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-30 10:34:21,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 10:34:21,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 10:34:21,202 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-30 10:34:21,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:21,202 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 10:34:21,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:34:21,203 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 10:34:21,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:34:21,203 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:21,204 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-30 10:34:21,204 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:21,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:21,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-30 10:34:21,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:21,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:21,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:21,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:21,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:21,317 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-30 10:34:21,318 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:21,318 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:21,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:21,355 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:21,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:21,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:21,364 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-30 10:34:21,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:21,374 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-30 10:34:21,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:21,790 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-30 10:34:21,810 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:21,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-30 10:34:21,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:34:21,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:34:21,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:34:21,812 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-30 10:34:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:21,891 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-30 10:34:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:34:21,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-30 10:34:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:21,893 INFO L225 Difference]: With dead ends: 27 [2018-09-30 10:34:21,893 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 10:34:21,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-30 10:34:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 10:34:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-30 10:34:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:34:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-30 10:34:21,898 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-30 10:34:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:21,899 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-30 10:34:21,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:34:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-30 10:34:21,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:34:21,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:21,900 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-30 10:34:21,900 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:21,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:21,901 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-30 10:34:21,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:21,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:21,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:21,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:21,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:22,170 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-30 10:34:22,171 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:22,171 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:22,180 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:22,202 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-30 10:34:22,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:22,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:22,214 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-30 10:34:22,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:22,223 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-30 10:34:22,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:22,353 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-30 10:34:22,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:22,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-30 10:34:22,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:34:22,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:34:22,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 10:34:22,376 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-30 10:34:22,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:22,446 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 10:34:22,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:34:22,451 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-30 10:34:22,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:22,452 INFO L225 Difference]: With dead ends: 31 [2018-09-30 10:34:22,452 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 10:34:22,453 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-30 10:34:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 10:34:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-30 10:34:22,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:34:22,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-30 10:34:22,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-30 10:34:22,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:22,459 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-30 10:34:22,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:34:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-30 10:34:22,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:34:22,460 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:22,460 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-30 10:34:22,460 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:22,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-30 10:34:22,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:22,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:22,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:22,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:22,644 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-30 10:34:22,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:22,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:22,659 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:22,690 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:34:22,690 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:22,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:22,698 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-30 10:34:22,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:22,709 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-30 10:34:22,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:22,866 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-30 10:34:22,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:22,887 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-30 10:34:22,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:34:22,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:34:22,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:34:22,890 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-30 10:34:23,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:23,007 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 10:34:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:34:23,008 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-30 10:34:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:23,011 INFO L225 Difference]: With dead ends: 35 [2018-09-30 10:34:23,011 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:34:23,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-30 10:34:23,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:34:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-30 10:34:23,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 10:34:23,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-30 10:34:23,018 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-30 10:34:23,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:23,018 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-30 10:34:23,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:34:23,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-30 10:34:23,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 10:34:23,019 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:23,019 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-30 10:34:23,020 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:23,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:23,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-30 10:34:23,020 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:23,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:23,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:23,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:23,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:23,161 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-30 10:34:23,161 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:23,161 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:23,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:23,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:23,199 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-30 10:34:23,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:23,211 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-30 10:34:23,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:23,389 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-30 10:34:23,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:23,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-30 10:34:23,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:34:23,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:34:23,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:34:23,420 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-30 10:34:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:23,551 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-30 10:34:23,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:34:23,552 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-30 10:34:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:23,554 INFO L225 Difference]: With dead ends: 39 [2018-09-30 10:34:23,554 INFO L226 Difference]: Without dead ends: 38 [2018-09-30 10:34:23,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-30 10:34:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-30 10:34:23,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-30 10:34:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:34:23,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 10:34:23,560 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-30 10:34:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:23,561 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 10:34:23,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:34:23,561 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 10:34:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:34:23,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:23,562 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-30 10:34:23,563 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:23,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:23,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-30 10:34:23,563 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:23,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:23,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:23,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:23,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:23,733 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-30 10:34:23,733 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:23,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:23,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:23,769 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:23,770 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:23,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:23,783 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-30 10:34:23,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:23,794 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-30 10:34:23,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:23,985 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-30 10:34:24,007 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:24,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-30 10:34:24,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:34:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:34:24,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:34:24,010 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-30 10:34:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:24,278 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-30 10:34:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:34:24,279 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-30 10:34:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:24,279 INFO L225 Difference]: With dead ends: 43 [2018-09-30 10:34:24,280 INFO L226 Difference]: Without dead ends: 42 [2018-09-30 10:34:24,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-30 10:34:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-30 10:34:24,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-30 10:34:24,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 10:34:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-30 10:34:24,286 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-30 10:34:24,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:24,287 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-30 10:34:24,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:34:24,287 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-30 10:34:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 10:34:24,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:24,288 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-30 10:34:24,289 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:24,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-30 10:34:24,289 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:24,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:24,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:24,453 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-30 10:34:24,454 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:24,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:24,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:24,604 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 10:34:24,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:24,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:24,634 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-30 10:34:24,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:24,733 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-30 10:34:24,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:25,265 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-30 10:34:25,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:25,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-30 10:34:25,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:34:25,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:34:25,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:34:25,287 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-30 10:34:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:25,410 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-30 10:34:25,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:34:25,410 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-30 10:34:25,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:25,411 INFO L225 Difference]: With dead ends: 47 [2018-09-30 10:34:25,411 INFO L226 Difference]: Without dead ends: 46 [2018-09-30 10:34:25,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 10:34:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-30 10:34:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-30 10:34:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 10:34:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-30 10:34:25,418 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-30 10:34:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:25,418 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-30 10:34:25,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:34:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-30 10:34:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:34:25,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:25,420 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-30 10:34:25,420 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:25,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:25,420 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-30 10:34:25,421 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:25,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:25,817 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-30 10:34:25,818 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:25,818 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:25,826 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:25,853 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:25,854 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:25,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:25,873 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-30 10:34:25,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:25,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-30 10:34:25,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:26,152 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-30 10:34:26,174 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:26,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-30 10:34:26,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 10:34:26,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 10:34:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-30 10:34:26,176 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-30 10:34:26,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:26,272 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-30 10:34:26,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:34:26,272 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-30 10:34:26,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:26,274 INFO L225 Difference]: With dead ends: 51 [2018-09-30 10:34:26,274 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 10:34:26,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-30 10:34:26,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 10:34:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-30 10:34:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-30 10:34:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-30 10:34:26,280 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-30 10:34:26,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:26,280 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-30 10:34:26,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 10:34:26,280 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-30 10:34:26,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 10:34:26,281 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:26,281 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-30 10:34:26,282 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:26,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-30 10:34:26,282 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:26,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:26,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:26,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:26,482 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-30 10:34:26,482 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:26,482 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:26,491 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:26,581 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 10:34:26,582 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:26,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:26,600 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-30 10:34:26,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:26,617 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-30 10:34:26,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:26,999 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-30 10:34:27,020 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:27,020 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-30 10:34:27,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 10:34:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 10:34:27,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-30 10:34:27,023 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-30 10:34:27,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:27,132 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-30 10:34:27,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:34:27,133 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-30 10:34:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:27,134 INFO L225 Difference]: With dead ends: 55 [2018-09-30 10:34:27,134 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 10:34:27,135 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-30 10:34:27,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 10:34:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-30 10:34:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 10:34:27,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-30 10:34:27,140 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-30 10:34:27,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:27,141 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-30 10:34:27,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 10:34:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-30 10:34:27,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 10:34:27,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:27,142 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-30 10:34:27,142 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:27,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:27,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-30 10:34:27,142 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:27,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:27,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:27,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:27,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:27,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:27,625 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-30 10:34:27,626 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:27,626 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:27,633 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:27,662 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:34:27,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:27,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:27,671 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-30 10:34:27,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:27,679 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-30 10:34:27,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:28,079 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-30 10:34:28,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:28,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-30 10:34:28,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 10:34:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 10:34:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-30 10:34:28,102 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-30 10:34:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:28,228 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-30 10:34:28,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:34:28,228 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-30 10:34:28,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:28,230 INFO L225 Difference]: With dead ends: 59 [2018-09-30 10:34:28,230 INFO L226 Difference]: Without dead ends: 58 [2018-09-30 10:34:28,231 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-30 10:34:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-30 10:34:28,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-30 10:34:28,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 10:34:28,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-30 10:34:28,237 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-30 10:34:28,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:28,237 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-30 10:34:28,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 10:34:28,238 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-30 10:34:28,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 10:34:28,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:28,239 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-30 10:34:28,239 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:28,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-30 10:34:28,239 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:28,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:28,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:28,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:28,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:28,609 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-30 10:34:28,610 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:28,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:28,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:28,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:28,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-30 10:34:28,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:28,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-30 10:34:28,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:29,013 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-30 10:34:29,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:29,042 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-30 10:34:29,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 10:34:29,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 10:34:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:34:29,044 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-30 10:34:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:29,266 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-30 10:34:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:34:29,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-30 10:34:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:29,268 INFO L225 Difference]: With dead ends: 63 [2018-09-30 10:34:29,268 INFO L226 Difference]: Without dead ends: 62 [2018-09-30 10:34:29,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-30 10:34:29,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-30 10:34:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-30 10:34:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 10:34:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-30 10:34:29,274 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-30 10:34:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:29,274 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-30 10:34:29,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 10:34:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-30 10:34:29,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 10:34:29,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:29,276 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-30 10:34:29,276 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:29,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-30 10:34:29,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:29,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:29,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:29,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:30,175 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-30 10:34:30,175 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:30,175 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:30,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:30,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:30,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:30,220 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-30 10:34:30,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:30,233 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-30 10:34:30,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:30,720 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-30 10:34:30,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:30,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-30 10:34:30,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 10:34:30,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 10:34:30,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:34:30,742 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-30 10:34:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:30,906 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-30 10:34:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:34:30,906 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-30 10:34:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:30,907 INFO L225 Difference]: With dead ends: 67 [2018-09-30 10:34:30,907 INFO L226 Difference]: Without dead ends: 66 [2018-09-30 10:34:30,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 10:34:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-30 10:34:30,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-30 10:34:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-30 10:34:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-30 10:34:30,913 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-30 10:34:30,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:30,913 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-30 10:34:30,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 10:34:30,913 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-30 10:34:30,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-30 10:34:30,914 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:30,914 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-30 10:34:30,915 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:30,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:30,915 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-30 10:34:30,915 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:30,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:30,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:30,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:30,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:31,592 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-30 10:34:31,593 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:31,593 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:31,603 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:31,644 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-30 10:34:31,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:31,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:31,668 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-30 10:34:31,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:31,677 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-30 10:34:31,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:31,947 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-30 10:34:31,967 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:31,968 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-30 10:34:31,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 10:34:31,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 10:34:31,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:34:31,969 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-30 10:34:32,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:32,103 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-30 10:34:32,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:34:32,103 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-30 10:34:32,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:32,104 INFO L225 Difference]: With dead ends: 71 [2018-09-30 10:34:32,104 INFO L226 Difference]: Without dead ends: 70 [2018-09-30 10:34:32,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 10:34:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-30 10:34:32,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-30 10:34:32,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-30 10:34:32,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-30 10:34:32,111 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-30 10:34:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:32,111 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-30 10:34:32,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 10:34:32,112 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-30 10:34:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 10:34:32,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:32,113 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-30 10:34:32,113 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:32,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:32,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-30 10:34:32,113 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:32,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:32,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:32,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:32,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:32,670 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-30 10:34:32,671 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:32,671 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:32,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:32,701 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:32,701 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:32,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:32,724 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-30 10:34:32,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:32,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-30 10:34:32,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:33,139 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-30 10:34:33,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:33,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-30 10:34:33,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 10:34:33,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 10:34:33,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 10:34:33,161 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-30 10:34:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:33,298 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-30 10:34:33,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:34:33,299 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-30 10:34:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:33,300 INFO L225 Difference]: With dead ends: 75 [2018-09-30 10:34:33,300 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 10:34:33,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 10:34:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 10:34:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-30 10:34:33,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 10:34:33,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-30 10:34:33,307 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-30 10:34:33,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:33,307 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-30 10:34:33,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 10:34:33,307 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-30 10:34:33,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-30 10:34:33,308 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:33,308 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-30 10:34:33,308 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:33,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:33,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-30 10:34:33,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:33,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:33,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:33,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:33,637 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-30 10:34:33,638 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:33,638 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:33,645 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:33,685 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-30 10:34:33,686 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:33,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:33,708 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-30 10:34:33,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:33,723 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-30 10:34:33,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:34,029 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-30 10:34:34,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:34,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-30 10:34:34,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 10:34:34,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 10:34:34,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 10:34:34,051 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-30 10:34:34,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:34,153 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-30 10:34:34,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:34:34,154 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-30 10:34:34,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:34,155 INFO L225 Difference]: With dead ends: 79 [2018-09-30 10:34:34,155 INFO L226 Difference]: Without dead ends: 78 [2018-09-30 10:34:34,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 10:34:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-30 10:34:34,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-30 10:34:34,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 10:34:34,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-30 10:34:34,160 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-30 10:34:34,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:34,161 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-30 10:34:34,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 10:34:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-30 10:34:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 10:34:34,162 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:34,162 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-30 10:34:34,162 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:34,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:34,162 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-30 10:34:34,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:34,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:34,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:34,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:34,528 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-30 10:34:34,529 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:34,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:34,539 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:34,588 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 10:34:34,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:34,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:34,601 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-30 10:34:34,601 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:34,612 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-30 10:34:34,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:35,235 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-30 10:34:35,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:35,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-30 10:34:35,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 10:34:35,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 10:34:35,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 10:34:35,257 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-30 10:34:35,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:35,368 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-30 10:34:35,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:34:35,368 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-30 10:34:35,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:35,369 INFO L225 Difference]: With dead ends: 83 [2018-09-30 10:34:35,369 INFO L226 Difference]: Without dead ends: 82 [2018-09-30 10:34:35,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 10:34:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-30 10:34:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-30 10:34:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 10:34:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-30 10:34:35,374 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-30 10:34:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:35,375 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-30 10:34:35,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 10:34:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-30 10:34:35,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 10:34:35,376 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:35,376 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-30 10:34:35,376 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:35,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-30 10:34:35,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:35,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:35,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:35,938 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-30 10:34:35,939 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:35,939 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:35,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:35,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:35,979 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-30 10:34:35,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:35,990 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-30 10:34:35,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:36,833 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-30 10:34:36,855 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:36,855 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-30 10:34:36,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 10:34:36,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 10:34:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 10:34:36,856 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-30 10:34:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:37,026 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-30 10:34:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:34:37,026 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-30 10:34:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:37,028 INFO L225 Difference]: With dead ends: 87 [2018-09-30 10:34:37,028 INFO L226 Difference]: Without dead ends: 86 [2018-09-30 10:34:37,029 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-30 10:34:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-30 10:34:37,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-30 10:34:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 10:34:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-30 10:34:37,034 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-30 10:34:37,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:37,035 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-30 10:34:37,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 10:34:37,035 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-30 10:34:37,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 10:34:37,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:37,036 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-30 10:34:37,036 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:37,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:37,037 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-30 10:34:37,037 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:37,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:37,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:37,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:37,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:37,805 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-30 10:34:37,805 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:37,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:37,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:37,862 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:37,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:37,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:37,883 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-30 10:34:37,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:37,892 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-30 10:34:37,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:38,236 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-30 10:34:38,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:38,257 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-30 10:34:38,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 10:34:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 10:34:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 10:34:38,258 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-30 10:34:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:38,426 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-30 10:34:38,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:34:38,427 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-30 10:34:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:38,428 INFO L225 Difference]: With dead ends: 91 [2018-09-30 10:34:38,428 INFO L226 Difference]: Without dead ends: 90 [2018-09-30 10:34:38,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-30 10:34:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-30 10:34:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-30 10:34:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 10:34:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-30 10:34:38,433 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-30 10:34:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:38,433 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-30 10:34:38,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 10:34:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-30 10:34:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-30 10:34:38,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:38,434 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-30 10:34:38,435 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:38,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:38,435 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-30 10:34:38,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:38,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:38,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:38,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:39,436 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-30 10:34:39,437 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:39,437 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:39,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:39,503 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-30 10:34:39,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:39,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:39,508 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-30 10:34:39,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:39,527 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-30 10:34:39,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:41,205 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-30 10:34:41,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:41,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-30 10:34:41,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 10:34:41,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 10:34:41,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 10:34:41,228 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-30 10:34:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:41,387 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-30 10:34:41,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:34:41,389 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-30 10:34:41,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:41,390 INFO L225 Difference]: With dead ends: 95 [2018-09-30 10:34:41,390 INFO L226 Difference]: Without dead ends: 94 [2018-09-30 10:34:41,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 10:34:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-30 10:34:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-30 10:34:41,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:34:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-30 10:34:41,394 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-30 10:34:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:41,394 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-30 10:34:41,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 10:34:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-30 10:34:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 10:34:41,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:41,395 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-30 10:34:41,395 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:41,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-30 10:34:41,396 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:41,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:41,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:41,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:41,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:41,748 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-30 10:34:41,748 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:41,748 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:41,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:41,795 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:41,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:41,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:41,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-30 10:34:41,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:41,811 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-30 10:34:41,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:42,227 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-30 10:34:42,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:42,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-30 10:34:42,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 10:34:42,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 10:34:42,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 10:34:42,250 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-30 10:34:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:42,412 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-30 10:34:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:34:42,413 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-30 10:34:42,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:42,414 INFO L225 Difference]: With dead ends: 99 [2018-09-30 10:34:42,414 INFO L226 Difference]: Without dead ends: 98 [2018-09-30 10:34:42,416 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-30 10:34:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-30 10:34:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-30 10:34:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 10:34:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-30 10:34:42,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-30 10:34:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:42,420 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-30 10:34:42,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 10:34:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-30 10:34:42,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 10:34:42,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:42,421 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-30 10:34:42,421 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:42,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:42,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-30 10:34:42,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:42,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:42,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:42,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:42,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:42,831 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-30 10:34:42,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:42,832 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:42,894 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-30 10:34:42,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:42,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:42,915 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-30 10:34:42,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:43,004 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-30 10:34:43,005 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:43,608 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-30 10:34:43,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:43,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-30 10:34:43,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 10:34:43,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 10:34:43,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:34:43,630 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-30 10:34:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:43,944 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-30 10:34:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:34:43,944 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-30 10:34:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:43,945 INFO L225 Difference]: With dead ends: 103 [2018-09-30 10:34:43,946 INFO L226 Difference]: Without dead ends: 102 [2018-09-30 10:34:43,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 10:34:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-30 10:34:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-30 10:34:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-30 10:34:43,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-30 10:34:43,950 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-30 10:34:43,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:43,950 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-30 10:34:43,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 10:34:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-30 10:34:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 10:34:43,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:43,951 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-30 10:34:43,952 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:43,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-30 10:34:43,952 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:43,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:43,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:44,518 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-30 10:34:44,518 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:44,518 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:44,528 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:44,592 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 10:34:44,592 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:44,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:44,600 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-30 10:34:44,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:44,619 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-30 10:34:44,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:45,081 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-30 10:34:45,101 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:45,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-30 10:34:45,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 10:34:45,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 10:34:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 10:34:45,103 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-30 10:34:45,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:45,302 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-30 10:34:45,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:34:45,303 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-30 10:34:45,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:45,304 INFO L225 Difference]: With dead ends: 107 [2018-09-30 10:34:45,304 INFO L226 Difference]: Without dead ends: 106 [2018-09-30 10:34:45,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-30 10:34:45,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-30 10:34:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-30 10:34:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-30 10:34:45,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-30 10:34:45,309 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-30 10:34:45,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:45,309 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-30 10:34:45,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 10:34:45,310 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-30 10:34:45,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-30 10:34:45,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:45,310 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-30 10:34:45,310 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:45,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:45,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-30 10:34:45,311 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:45,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:45,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:45,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:45,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:45,790 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-30 10:34:45,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:45,790 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:45,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:45,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:45,837 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-30 10:34:45,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:45,845 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-30 10:34:45,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:46,653 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-30 10:34:46,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:46,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-30 10:34:46,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 10:34:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 10:34:46,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 10:34:46,675 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-30 10:34:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:46,864 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-30 10:34:46,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:34:46,865 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-30 10:34:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:46,866 INFO L225 Difference]: With dead ends: 111 [2018-09-30 10:34:46,866 INFO L226 Difference]: Without dead ends: 110 [2018-09-30 10:34:46,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 10:34:46,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-30 10:34:46,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-30 10:34:46,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 10:34:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-30 10:34:46,872 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-30 10:34:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:46,872 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-30 10:34:46,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 10:34:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-30 10:34:46,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 10:34:46,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:46,873 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-30 10:34:46,873 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:46,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:46,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-30 10:34:46,873 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:46,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:46,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:46,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:47,463 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-30 10:34:47,463 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:47,464 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:47,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:47,511 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:47,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:47,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:47,517 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-30 10:34:47,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:47,528 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-30 10:34:47,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:48,047 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-30 10:34:48,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:48,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-30 10:34:48,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 10:34:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 10:34:48,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 10:34:48,070 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-30 10:34:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:48,285 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-30 10:34:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:34:48,285 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-30 10:34:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:48,287 INFO L225 Difference]: With dead ends: 115 [2018-09-30 10:34:48,287 INFO L226 Difference]: Without dead ends: 114 [2018-09-30 10:34:48,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 10:34:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-30 10:34:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-30 10:34:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 10:34:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-30 10:34:48,292 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-30 10:34:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:48,293 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-30 10:34:48,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 10:34:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-30 10:34:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-30 10:34:48,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:48,294 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-30 10:34:48,294 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:48,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-30 10:34:48,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:48,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:48,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:48,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:48,862 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-30 10:34:48,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:48,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:48,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:34:48,950 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-30 10:34:48,950 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:48,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:48,972 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-30 10:34:48,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:49,008 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-30 10:34:49,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:49,551 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-30 10:34:49,571 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:49,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-30 10:34:49,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 10:34:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 10:34:49,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:34:49,573 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-30 10:34:49,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:49,770 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-30 10:34:49,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:34:49,771 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-30 10:34:49,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:49,772 INFO L225 Difference]: With dead ends: 119 [2018-09-30 10:34:49,772 INFO L226 Difference]: Without dead ends: 118 [2018-09-30 10:34:49,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 10:34:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-30 10:34:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-30 10:34:49,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-30 10:34:49,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-30 10:34:49,777 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-30 10:34:49,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:49,777 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-30 10:34:49,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 10:34:49,778 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-30 10:34:49,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-30 10:34:49,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:49,778 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-30 10:34:49,778 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:49,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:49,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-30 10:34:49,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:49,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:49,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:49,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:50,483 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-30 10:34:50,483 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:50,484 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:50,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:34:50,529 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:34:50,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:50,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:50,553 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-30 10:34:50,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:50,638 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-30 10:34:50,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:51,624 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-30 10:34:51,645 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:51,645 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-30 10:34:51,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 10:34:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 10:34:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 10:34:51,646 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-30 10:34:51,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:51,819 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-30 10:34:51,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:34:51,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-30 10:34:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:51,821 INFO L225 Difference]: With dead ends: 123 [2018-09-30 10:34:51,821 INFO L226 Difference]: Without dead ends: 122 [2018-09-30 10:34:51,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-30 10:34:51,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-30 10:34:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-30 10:34:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-30 10:34:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-30 10:34:51,827 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-30 10:34:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:51,828 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-30 10:34:51,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 10:34:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-30 10:34:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-30 10:34:51,829 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:51,829 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-30 10:34:51,829 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:51,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-30 10:34:51,829 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:51,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:52,476 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-30 10:34:52,476 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:52,477 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:52,484 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:34:52,561 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-30 10:34:52,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:52,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:52,569 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-30 10:34:52,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:52,581 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-30 10:34:52,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:53,250 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-30 10:34:53,270 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:53,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-30 10:34:53,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 10:34:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 10:34:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 10:34:53,273 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-30 10:34:53,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:53,571 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-30 10:34:53,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:34:53,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-30 10:34:53,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:53,573 INFO L225 Difference]: With dead ends: 127 [2018-09-30 10:34:53,573 INFO L226 Difference]: Without dead ends: 126 [2018-09-30 10:34:53,573 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-30 10:34:53,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-30 10:34:53,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-30 10:34:53,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-30 10:34:53,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-30 10:34:53,577 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-30 10:34:53,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:53,577 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-30 10:34:53,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 10:34:53,578 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-30 10:34:53,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-30 10:34:53,578 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:53,578 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-30 10:34:53,578 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:53,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-30 10:34:53,579 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:53,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:53,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:53,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:53,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:54,576 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-30 10:34:54,577 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:54,577 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:54,586 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:34:54,682 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 10:34:54,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:54,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:54,688 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-30 10:34:54,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:54,696 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-30 10:34:54,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:55,359 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-30 10:34:55,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:55,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-30 10:34:55,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 10:34:55,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 10:34:55,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-30 10:34:55,381 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-30 10:34:55,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:55,584 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-30 10:34:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 10:34:55,584 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-30 10:34:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:55,586 INFO L225 Difference]: With dead ends: 131 [2018-09-30 10:34:55,586 INFO L226 Difference]: Without dead ends: 130 [2018-09-30 10:34:55,587 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-30 10:34:55,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-30 10:34:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-30 10:34:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 10:34:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-30 10:34:55,591 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-30 10:34:55,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:55,591 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-30 10:34:55,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 10:34:55,592 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-30 10:34:55,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-30 10:34:55,592 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:55,592 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-30 10:34:55,593 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:55,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-30 10:34:55,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:55,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:55,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:55,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:34:55,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:56,639 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-30 10:34:56,639 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:56,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:56,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:56,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:56,714 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-30 10:34:56,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:56,753 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-30 10:34:56,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:34:57,622 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-30 10:34:57,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:34:57,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-30 10:34:57,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 10:34:57,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 10:34:57,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 10:34:57,644 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-30 10:34:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:34:57,851 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-30 10:34:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:34:57,852 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-30 10:34:57,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:34:57,853 INFO L225 Difference]: With dead ends: 135 [2018-09-30 10:34:57,853 INFO L226 Difference]: Without dead ends: 134 [2018-09-30 10:34:57,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 10:34:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-30 10:34:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-30 10:34:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-30 10:34:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-30 10:34:57,859 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-30 10:34:57,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:34:57,860 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-30 10:34:57,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 10:34:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-30 10:34:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-30 10:34:57,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:34:57,861 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-30 10:34:57,861 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:34:57,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:34:57,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-30 10:34:57,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:34:57,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:34:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:57,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:34:57,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:34:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:34:59,302 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-30 10:34:59,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:34:59,303 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:34:59,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:34:59,364 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:34:59,365 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:34:59,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:34:59,388 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-30 10:34:59,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:34:59,394 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-30 10:34:59,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:00,622 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-30 10:35:00,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:00,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-30 10:35:00,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 10:35:00,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 10:35:00,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 10:35:00,645 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-30 10:35:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:00,871 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-30 10:35:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 10:35:00,872 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-30 10:35:00,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:00,873 INFO L225 Difference]: With dead ends: 139 [2018-09-30 10:35:00,874 INFO L226 Difference]: Without dead ends: 138 [2018-09-30 10:35:00,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 10:35:00,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-30 10:35:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-30 10:35:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-30 10:35:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-30 10:35:00,879 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-30 10:35:00,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:00,879 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-30 10:35:00,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 10:35:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-30 10:35:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-30 10:35:00,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:00,880 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-30 10:35:00,881 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:00,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:00,881 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-30 10:35:00,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:00,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:00,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:00,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:00,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:01,839 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-30 10:35:01,839 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:01,839 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:01,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:01,948 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-30 10:35:01,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:01,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:01,972 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-30 10:35:01,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:02,066 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-30 10:35:02,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:03,907 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-30 10:35:03,927 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:03,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-30 10:35:03,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 10:35:03,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 10:35:03,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 10:35:03,929 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-30 10:35:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:04,247 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-30 10:35:04,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 10:35:04,247 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-30 10:35:04,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:04,249 INFO L225 Difference]: With dead ends: 143 [2018-09-30 10:35:04,249 INFO L226 Difference]: Without dead ends: 142 [2018-09-30 10:35:04,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 10:35:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-30 10:35:04,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-30 10:35:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 10:35:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-30 10:35:04,255 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-30 10:35:04,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:04,256 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-30 10:35:04,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 10:35:04,256 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-30 10:35:04,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 10:35:04,256 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:04,257 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-30 10:35:04,257 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:04,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:04,257 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-30 10:35:04,257 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:04,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:04,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:04,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:04,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:05,003 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-30 10:35:05,003 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:05,003 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:05,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:05,054 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:05,055 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:05,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:05,063 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-30 10:35:05,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:05,073 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-30 10:35:05,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:05,956 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-30 10:35:05,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:05,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-30 10:35:05,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 10:35:05,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 10:35:05,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 10:35:05,978 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-30 10:35:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:06,381 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-30 10:35:06,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:35:06,381 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-30 10:35:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:06,382 INFO L225 Difference]: With dead ends: 147 [2018-09-30 10:35:06,382 INFO L226 Difference]: Without dead ends: 146 [2018-09-30 10:35:06,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 10:35:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-30 10:35:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-30 10:35:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-30 10:35:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-30 10:35:06,391 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-30 10:35:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:06,391 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-30 10:35:06,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 10:35:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-30 10:35:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-30 10:35:06,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:06,392 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-30 10:35:06,393 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:06,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-30 10:35:06,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:06,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:06,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:06,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:06,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:07,298 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-30 10:35:07,298 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:07,298 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:07,306 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:07,394 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-30 10:35:07,395 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:07,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:07,402 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-30 10:35:07,402 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:07,412 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-30 10:35:07,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:08,314 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-30 10:35:08,334 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:08,334 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-30 10:35:08,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 10:35:08,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 10:35:08,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 10:35:08,336 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-30 10:35:08,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:08,795 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-30 10:35:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:35:08,796 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-30 10:35:08,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:08,797 INFO L225 Difference]: With dead ends: 151 [2018-09-30 10:35:08,798 INFO L226 Difference]: Without dead ends: 150 [2018-09-30 10:35:08,799 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-30 10:35:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-30 10:35:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-30 10:35:08,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-30 10:35:08,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-30 10:35:08,803 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-30 10:35:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:08,804 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-30 10:35:08,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 10:35:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-30 10:35:08,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-30 10:35:08,805 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:08,805 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-30 10:35:08,805 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:08,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:08,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-30 10:35:08,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:08,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:08,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:08,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:09,611 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-30 10:35:09,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:09,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:09,619 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:10,082 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 10:35:10,082 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:10,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:10,101 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-30 10:35:10,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:10,111 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-30 10:35:10,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:11,021 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-30 10:35:11,042 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:11,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-30 10:35:11,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 10:35:11,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 10:35:11,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 10:35:11,044 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-30 10:35:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:11,340 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-30 10:35:11,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:35:11,341 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-30 10:35:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:11,342 INFO L225 Difference]: With dead ends: 155 [2018-09-30 10:35:11,343 INFO L226 Difference]: Without dead ends: 154 [2018-09-30 10:35:11,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-30 10:35:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-30 10:35:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-30 10:35:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-30 10:35:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-30 10:35:11,349 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-30 10:35:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:11,349 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-30 10:35:11,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 10:35:11,350 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-30 10:35:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-30 10:35:11,350 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:11,351 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-30 10:35:11,351 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:11,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-30 10:35:11,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:11,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:11,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:11,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:11,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:12,400 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-30 10:35:12,400 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:12,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:12,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:12,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:12,478 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-30 10:35:12,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:12,547 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-30 10:35:12,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:13,522 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-30 10:35:13,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:13,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-30 10:35:13,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 10:35:13,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 10:35:13,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 10:35:13,544 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-30 10:35:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:13,828 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-30 10:35:13,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:35:13,829 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-30 10:35:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:13,830 INFO L225 Difference]: With dead ends: 159 [2018-09-30 10:35:13,831 INFO L226 Difference]: Without dead ends: 158 [2018-09-30 10:35:13,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 10:35:13,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-30 10:35:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-30 10:35:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-30 10:35:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-30 10:35:13,836 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-30 10:35:13,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:13,836 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-30 10:35:13,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 10:35:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-30 10:35:13,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-30 10:35:13,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:13,838 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-30 10:35:13,838 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:13,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:13,838 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-30 10:35:13,838 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:13,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:13,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:13,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:14,854 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-30 10:35:14,855 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:14,855 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:14,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:14,908 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:14,908 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:14,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:14,915 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-30 10:35:14,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:14,926 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-30 10:35:14,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:15,986 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-30 10:35:16,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:16,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-30 10:35:16,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 10:35:16,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 10:35:16,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 10:35:16,007 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-30 10:35:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:16,336 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-30 10:35:16,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:35:16,336 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-30 10:35:16,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:16,338 INFO L225 Difference]: With dead ends: 163 [2018-09-30 10:35:16,338 INFO L226 Difference]: Without dead ends: 162 [2018-09-30 10:35:16,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-30 10:35:16,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-30 10:35:16,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-30 10:35:16,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-30 10:35:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-30 10:35:16,345 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-30 10:35:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:16,345 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-30 10:35:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 10:35:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-30 10:35:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-30 10:35:16,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:16,346 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-30 10:35:16,346 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:16,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:16,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-30 10:35:16,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:16,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:16,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:16,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:16,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:17,717 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-30 10:35:17,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:17,718 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:17,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:17,863 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-30 10:35:17,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:17,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:17,872 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-30 10:35:17,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:17,883 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-30 10:35:17,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:18,893 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-30 10:35:18,913 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:18,913 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-30 10:35:18,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 10:35:18,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 10:35:18,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 10:35:18,915 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-30 10:35:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:19,463 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-30 10:35:19,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:35:19,464 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-30 10:35:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:19,465 INFO L225 Difference]: With dead ends: 167 [2018-09-30 10:35:19,465 INFO L226 Difference]: Without dead ends: 166 [2018-09-30 10:35:19,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 10:35:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-30 10:35:19,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-30 10:35:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-30 10:35:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-30 10:35:19,472 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-30 10:35:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:19,472 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-30 10:35:19,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 10:35:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-30 10:35:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-30 10:35:19,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:19,473 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-30 10:35:19,474 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:19,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:19,474 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-30 10:35:19,474 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:19,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:19,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:19,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:21,205 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-30 10:35:21,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:21,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:21,213 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:21,264 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:21,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:21,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:21,288 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-30 10:35:21,288 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:21,338 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-30 10:35:21,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:22,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-30 10:35:22,658 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:22,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-30 10:35:22,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 10:35:22,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 10:35:22,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 10:35:22,660 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-30 10:35:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:22,945 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-30 10:35:22,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:35:22,946 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-30 10:35:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:22,947 INFO L225 Difference]: With dead ends: 171 [2018-09-30 10:35:22,947 INFO L226 Difference]: Without dead ends: 170 [2018-09-30 10:35:22,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 10:35:22,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-30 10:35:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-30 10:35:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-30 10:35:22,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-30 10:35:22,953 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-30 10:35:22,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:22,954 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-30 10:35:22,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 10:35:22,954 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-30 10:35:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-30 10:35:22,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:22,955 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-30 10:35:22,955 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:22,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-30 10:35:22,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:22,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:22,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:22,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:22,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:24,030 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-30 10:35:24,030 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:24,031 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:24,041 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:24,200 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-30 10:35:24,200 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:24,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:24,226 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-30 10:35:24,226 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:24,317 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-30 10:35:24,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:25,517 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-30 10:35:25,537 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:25,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-30 10:35:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 10:35:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 10:35:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 10:35:25,538 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-30 10:35:25,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:25,873 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-30 10:35:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:35:25,874 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-30 10:35:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:25,875 INFO L225 Difference]: With dead ends: 175 [2018-09-30 10:35:25,875 INFO L226 Difference]: Without dead ends: 174 [2018-09-30 10:35:25,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 10:35:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-30 10:35:25,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-30 10:35:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-30 10:35:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-30 10:35:25,881 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-30 10:35:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:25,881 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-30 10:35:25,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 10:35:25,881 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-30 10:35:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-30 10:35:25,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:25,882 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-30 10:35:25,882 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:25,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-30 10:35:25,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:25,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:25,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:25,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:25,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:27,172 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-30 10:35:27,172 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:27,172 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:27,182 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:27,383 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 10:35:27,383 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:27,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:27,391 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-30 10:35:27,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:27,399 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-30 10:35:27,399 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:28,665 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-30 10:35:28,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:28,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-30 10:35:28,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 10:35:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 10:35:28,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 10:35:28,688 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-30 10:35:29,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:29,299 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-30 10:35:29,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:35:29,300 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-30 10:35:29,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:29,301 INFO L225 Difference]: With dead ends: 179 [2018-09-30 10:35:29,301 INFO L226 Difference]: Without dead ends: 178 [2018-09-30 10:35:29,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-30 10:35:29,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-30 10:35:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-30 10:35:29,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-30 10:35:29,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-30 10:35:29,308 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-30 10:35:29,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:29,308 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-30 10:35:29,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 10:35:29,308 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-30 10:35:29,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-30 10:35:29,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:29,309 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-30 10:35:29,310 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:29,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:29,310 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-30 10:35:29,310 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:29,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:29,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:29,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:30,406 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-30 10:35:30,407 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:30,407 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:30,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:30,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:30,476 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-30 10:35:30,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:30,490 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-30 10:35:30,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:31,730 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-30 10:35:31,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:31,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-30 10:35:31,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 10:35:31,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 10:35:31,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 10:35:31,753 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-30 10:35:32,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:32,077 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-30 10:35:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 10:35:32,077 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-30 10:35:32,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:32,078 INFO L225 Difference]: With dead ends: 183 [2018-09-30 10:35:32,078 INFO L226 Difference]: Without dead ends: 182 [2018-09-30 10:35:32,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-30 10:35:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-30 10:35:32,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-30 10:35:32,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-30 10:35:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-30 10:35:32,083 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-30 10:35:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:32,083 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-30 10:35:32,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 10:35:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-30 10:35:32,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-30 10:35:32,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:32,084 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-30 10:35:32,085 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:32,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:32,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-30 10:35:32,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:32,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:32,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:32,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:33,265 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-30 10:35:33,265 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:33,265 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:33,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:33,327 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:33,327 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:33,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:33,334 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-30 10:35:33,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:33,346 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-30 10:35:33,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:34,709 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-30 10:35:34,730 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:34,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-30 10:35:34,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 10:35:34,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 10:35:34,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 10:35:34,732 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-30 10:35:35,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:35,020 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-30 10:35:35,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:35:35,020 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-30 10:35:35,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:35,022 INFO L225 Difference]: With dead ends: 187 [2018-09-30 10:35:35,022 INFO L226 Difference]: Without dead ends: 186 [2018-09-30 10:35:35,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 10:35:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-30 10:35:35,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-30 10:35:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-30 10:35:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-30 10:35:35,028 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-30 10:35:35,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:35,028 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-30 10:35:35,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 10:35:35,028 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-30 10:35:35,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-30 10:35:35,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:35,029 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-30 10:35:35,030 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:35,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-30 10:35:35,030 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:35,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:35,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:35,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:35,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:36,188 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-30 10:35:36,189 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:36,189 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:36,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:35:36,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-30 10:35:36,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:36,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:36,373 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-30 10:35:36,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:36,383 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-30 10:35:36,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:38,027 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-30 10:35:38,047 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:38,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-30 10:35:38,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 10:35:38,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 10:35:38,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 10:35:38,049 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-30 10:35:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:38,369 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-30 10:35:38,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:35:38,369 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-30 10:35:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:38,371 INFO L225 Difference]: With dead ends: 191 [2018-09-30 10:35:38,371 INFO L226 Difference]: Without dead ends: 190 [2018-09-30 10:35:38,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 10:35:38,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-30 10:35:38,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-30 10:35:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-30 10:35:38,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-30 10:35:38,377 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-30 10:35:38,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:38,377 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-30 10:35:38,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 10:35:38,378 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-30 10:35:38,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-30 10:35:38,378 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:38,378 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-30 10:35:38,379 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:38,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:38,379 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-30 10:35:38,379 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:38,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:38,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:38,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:38,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:39,978 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-30 10:35:39,978 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:39,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:39,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:35:40,046 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:35:40,047 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:40,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:40,054 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-30 10:35:40,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:40,064 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-30 10:35:40,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:42,986 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-30 10:35:43,006 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:43,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-30 10:35:43,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 10:35:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 10:35:43,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 10:35:43,008 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-30 10:35:43,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:43,491 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-30 10:35:43,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:35:43,491 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-30 10:35:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:43,492 INFO L225 Difference]: With dead ends: 195 [2018-09-30 10:35:43,493 INFO L226 Difference]: Without dead ends: 194 [2018-09-30 10:35:43,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-30 10:35:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-30 10:35:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-30 10:35:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-30 10:35:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-30 10:35:43,498 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-30 10:35:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:43,499 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-30 10:35:43,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 10:35:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-30 10:35:43,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-30 10:35:43,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:43,500 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-30 10:35:43,500 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:43,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:43,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-30 10:35:43,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:43,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:43,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:43,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:43,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:43,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:44,878 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-30 10:35:44,879 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:44,879 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:44,886 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:35:45,020 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-30 10:35:45,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:45,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:45,043 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-30 10:35:45,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:45,136 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-30 10:35:45,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:46,706 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-30 10:35:46,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:46,727 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-30 10:35:46,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 10:35:46,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 10:35:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 10:35:46,729 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-30 10:35:47,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:47,146 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-30 10:35:47,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:35:47,146 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-30 10:35:47,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:47,148 INFO L225 Difference]: With dead ends: 199 [2018-09-30 10:35:47,148 INFO L226 Difference]: Without dead ends: 198 [2018-09-30 10:35:47,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 10:35:47,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-30 10:35:47,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-30 10:35:47,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-30 10:35:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-30 10:35:47,155 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-30 10:35:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:47,156 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-30 10:35:47,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 10:35:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-30 10:35:47,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-30 10:35:47,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:47,157 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-30 10:35:47,157 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:47,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:47,158 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-30 10:35:47,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:47,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:47,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:47,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:47,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:47,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:48,690 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-30 10:35:48,691 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:48,691 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:35:48,699 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:35:48,868 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 10:35:48,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:48,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:48,876 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-30 10:35:48,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:48,885 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-30 10:35:48,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:50,369 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-30 10:35:50,390 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:50,390 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-30 10:35:50,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 10:35:50,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 10:35:50,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 10:35:50,392 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-30 10:35:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:50,778 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-30 10:35:50,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:35:50,779 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-30 10:35:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:50,780 INFO L225 Difference]: With dead ends: 203 [2018-09-30 10:35:50,780 INFO L226 Difference]: Without dead ends: 202 [2018-09-30 10:35:50,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 10:35:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-30 10:35:50,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-30 10:35:50,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-30 10:35:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-30 10:35:50,787 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-30 10:35:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:50,787 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-30 10:35:50,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 10:35:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-30 10:35:50,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-30 10:35:50,788 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:50,788 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-30 10:35:50,788 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:50,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:50,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-30 10:35:50,789 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:50,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:50,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:50,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:52,151 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-30 10:35:52,152 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:52,152 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-30 10:35:52,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:52,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:52,229 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-30 10:35:52,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:52,237 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-30 10:35:52,237 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:53,984 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-30 10:35:54,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:54,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-30 10:35:54,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 10:35:54,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 10:35:54,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 10:35:54,006 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-30 10:35:54,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:54,337 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-30 10:35:54,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:35:54,337 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-30 10:35:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:54,339 INFO L225 Difference]: With dead ends: 207 [2018-09-30 10:35:54,339 INFO L226 Difference]: Without dead ends: 206 [2018-09-30 10:35:54,340 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-30 10:35:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-30 10:35:54,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-30 10:35:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-30 10:35:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-30 10:35:54,346 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-30 10:35:54,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:54,346 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-30 10:35:54,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 10:35:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-30 10:35:54,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-30 10:35:54,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:54,347 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-30 10:35:54,348 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:54,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:54,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-30 10:35:54,348 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:54,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:54,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:35:54,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:35:55,798 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-30 10:35:55,799 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:35:55,799 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:35:55,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:35:55,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:35:55,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:35:55,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:35:55,874 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-30 10:35:55,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:35:55,882 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-30 10:35:55,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:35:58,135 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-30 10:35:58,156 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:35:58,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-30 10:35:58,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 10:35:58,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 10:35:58,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 10:35:58,158 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-30 10:35:58,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:35:58,486 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-30 10:35:58,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:35:58,486 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-30 10:35:58,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:35:58,488 INFO L225 Difference]: With dead ends: 211 [2018-09-30 10:35:58,489 INFO L226 Difference]: Without dead ends: 210 [2018-09-30 10:35:58,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-30 10:35:58,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-30 10:35:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-30 10:35:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-30 10:35:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-30 10:35:58,495 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-30 10:35:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:35:58,495 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-30 10:35:58,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 10:35:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-30 10:35:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-30 10:35:58,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:35:58,496 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-30 10:35:58,497 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:35:58,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:35:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-30 10:35:58,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:35:58,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:35:58,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:58,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:35:58,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:35:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:00,535 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-30 10:36:00,535 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:00,535 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:00,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:36:01,146 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-30 10:36:01,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:01,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:01,157 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-30 10:36:01,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:01,168 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-30 10:36:01,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:03,167 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-30 10:36:03,188 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:03,189 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-30 10:36:03,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 10:36:03,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 10:36:03,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 10:36:03,191 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-30 10:36:03,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:03,532 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-30 10:36:03,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 10:36:03,533 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-30 10:36:03,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:03,535 INFO L225 Difference]: With dead ends: 215 [2018-09-30 10:36:03,535 INFO L226 Difference]: Without dead ends: 214 [2018-09-30 10:36:03,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 10:36:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-30 10:36:03,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-30 10:36:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-30 10:36:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-30 10:36:03,541 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-30 10:36:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:03,542 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-30 10:36:03,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 10:36:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-30 10:36:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-30 10:36:03,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:03,543 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-30 10:36:03,543 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:03,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:03,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-30 10:36:03,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:03,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:03,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:03,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:05,094 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-30 10:36:05,095 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:05,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:05,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:36:05,176 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:36:05,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:05,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:05,208 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-30 10:36:05,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:05,240 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-30 10:36:05,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:06,965 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-30 10:36:06,985 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:06,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-30 10:36:06,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-30 10:36:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-30 10:36:06,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 10:36:06,987 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-30 10:36:07,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:07,337 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-30 10:36:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:36:07,338 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-30 10:36:07,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:07,339 INFO L225 Difference]: With dead ends: 219 [2018-09-30 10:36:07,339 INFO L226 Difference]: Without dead ends: 218 [2018-09-30 10:36:07,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 10:36:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-30 10:36:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-30 10:36:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-30 10:36:07,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-30 10:36:07,344 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-30 10:36:07,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:07,345 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-30 10:36:07,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-30 10:36:07,345 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-30 10:36:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-30 10:36:07,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:07,346 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-30 10:36:07,346 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:07,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:07,346 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-30 10:36:07,346 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:07,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:07,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:07,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:09,002 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-30 10:36:09,002 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:09,002 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-30 10:36:09,010 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:36:09,159 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-30 10:36:09,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:09,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:09,190 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-30 10:36:09,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:09,196 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-30 10:36:09,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:10,952 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-30 10:36:10,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:10,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-30 10:36:10,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-30 10:36:10,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-30 10:36:10,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 10:36:10,976 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-30 10:36:11,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:11,349 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-30 10:36:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:36:11,349 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-30 10:36:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:11,351 INFO L225 Difference]: With dead ends: 223 [2018-09-30 10:36:11,351 INFO L226 Difference]: Without dead ends: 222 [2018-09-30 10:36:11,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 10:36:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-30 10:36:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-30 10:36:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-30 10:36:11,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-30 10:36:11,355 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-30 10:36:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:11,356 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-30 10:36:11,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-30 10:36:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-30 10:36:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-30 10:36:11,357 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:11,357 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-30 10:36:11,357 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:11,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-30 10:36:11,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:11,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:11,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:11,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:11,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:12,978 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-30 10:36:12,978 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:12,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:12,985 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:36:13,210 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-30 10:36:13,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:13,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:13,219 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-30 10:36:13,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:13,230 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-30 10:36:13,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:15,183 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-30 10:36:15,203 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:15,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-30 10:36:15,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-30 10:36:15,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-30 10:36:15,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 10:36:15,206 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-30 10:36:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:15,543 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-30 10:36:15,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:36:15,544 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-30 10:36:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:15,545 INFO L225 Difference]: With dead ends: 227 [2018-09-30 10:36:15,545 INFO L226 Difference]: Without dead ends: 226 [2018-09-30 10:36:15,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-30 10:36:15,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-30 10:36:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-30 10:36:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-30 10:36:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-30 10:36:15,553 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-30 10:36:15,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:15,553 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-30 10:36:15,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-30 10:36:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-30 10:36:15,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-30 10:36:15,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:15,554 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-30 10:36:15,554 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:15,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-30 10:36:15,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:15,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:15,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:17,326 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-30 10:36:17,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:17,326 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-30 10:36:17,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:17,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:17,406 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-30 10:36:17,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:17,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-30 10:36:17,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:19,511 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-30 10:36:19,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:19,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-30 10:36:19,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-30 10:36:19,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-30 10:36:19,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 10:36:19,533 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-30 10:36:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:19,939 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-30 10:36:19,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 10:36:19,940 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-30 10:36:19,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:19,942 INFO L225 Difference]: With dead ends: 231 [2018-09-30 10:36:19,942 INFO L226 Difference]: Without dead ends: 230 [2018-09-30 10:36:19,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 10:36:19,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-30 10:36:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-30 10:36:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-30 10:36:19,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-30 10:36:19,949 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-30 10:36:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:19,949 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-30 10:36:19,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-30 10:36:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-30 10:36:19,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-30 10:36:19,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:19,951 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-30 10:36:19,951 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:19,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:19,951 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-30 10:36:19,951 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:19,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:19,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:19,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:21,660 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-30 10:36:21,660 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:21,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:36:21,741 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:36:21,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:21,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:21,762 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-30 10:36:21,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:21,771 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-30 10:36:21,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:24,090 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-30 10:36:24,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:24,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-30 10:36:24,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 10:36:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 10:36:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 10:36:24,112 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-30 10:36:24,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:24,535 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-30 10:36:24,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 10:36:24,536 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-30 10:36:24,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:24,537 INFO L225 Difference]: With dead ends: 235 [2018-09-30 10:36:24,537 INFO L226 Difference]: Without dead ends: 234 [2018-09-30 10:36:24,538 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-30 10:36:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-30 10:36:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-30 10:36:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-30 10:36:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-30 10:36:24,543 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-30 10:36:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:24,543 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-30 10:36:24,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 10:36:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-30 10:36:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-30 10:36:24,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:24,545 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-30 10:36:24,545 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:24,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:24,545 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-30 10:36:24,545 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:24,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:24,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:24,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:26,858 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-30 10:36:26,858 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:26,858 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-30 10:36:26,865 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:36:27,127 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-30 10:36:27,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:27,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:27,138 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-30 10:36:27,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:27,146 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-30 10:36:27,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:29,538 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-30 10:36:29,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:29,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-30 10:36:29,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-30 10:36:29,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-30 10:36:29,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 10:36:29,562 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-30 10:36:29,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:29,977 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-30 10:36:29,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 10:36:29,978 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-30 10:36:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:29,979 INFO L225 Difference]: With dead ends: 239 [2018-09-30 10:36:29,979 INFO L226 Difference]: Without dead ends: 238 [2018-09-30 10:36:29,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 10:36:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-30 10:36:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-30 10:36:29,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-30 10:36:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-30 10:36:29,985 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-30 10:36:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:29,985 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-30 10:36:29,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-30 10:36:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-30 10:36:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-30 10:36:29,986 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:29,986 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-30 10:36:29,987 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:29,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-30 10:36:29,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:29,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:29,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:29,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:31,850 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-30 10:36:31,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:31,850 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-30 10:36:31,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:36:31,939 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:36:31,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:31,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:31,949 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-30 10:36:31,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:31,957 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-30 10:36:31,957 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:34,268 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-30 10:36:34,290 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:34,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-30 10:36:34,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-30 10:36:34,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-30 10:36:34,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 10:36:34,293 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-30 10:36:34,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:34,801 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-30 10:36:34,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 10:36:34,802 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-30 10:36:34,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:34,803 INFO L225 Difference]: With dead ends: 243 [2018-09-30 10:36:34,803 INFO L226 Difference]: Without dead ends: 242 [2018-09-30 10:36:34,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-30 10:36:34,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-30 10:36:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-30 10:36:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-30 10:36:34,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-30 10:36:34,809 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-30 10:36:34,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:34,809 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-30 10:36:34,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-30 10:36:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-30 10:36:34,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-30 10:36:34,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:34,810 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-30 10:36:34,810 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:34,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-30 10:36:34,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:34,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:34,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:36,623 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-30 10:36:36,624 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:36,624 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:36,632 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:36:36,809 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-30 10:36:36,809 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:36,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:36,823 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-30 10:36:36,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:36,835 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-30 10:36:36,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:39,253 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-30 10:36:39,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:39,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-30 10:36:39,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-30 10:36:39,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-30 10:36:39,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 10:36:39,276 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-30 10:36:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:39,670 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-30 10:36:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 10:36:39,670 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-30 10:36:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:39,672 INFO L225 Difference]: With dead ends: 247 [2018-09-30 10:36:39,672 INFO L226 Difference]: Without dead ends: 246 [2018-09-30 10:36:39,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-30 10:36:39,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-30 10:36:39,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-30 10:36:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-30 10:36:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-30 10:36:39,679 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-30 10:36:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:39,679 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-30 10:36:39,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-30 10:36:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-30 10:36:39,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-30 10:36:39,681 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:39,681 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-30 10:36:39,681 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:39,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-30 10:36:39,682 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:39,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:39,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:39,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:39,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:39,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:41,545 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-30 10:36:41,545 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:41,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:41,554 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:36:41,938 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-30 10:36:41,939 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:41,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:41,948 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-30 10:36:41,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:41,956 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-30 10:36:41,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:44,398 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-30 10:36:44,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:44,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-30 10:36:44,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-30 10:36:44,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-30 10:36:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-30 10:36:44,421 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-30 10:36:44,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:44,924 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-30 10:36:44,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 10:36:44,924 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-30 10:36:44,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:44,925 INFO L225 Difference]: With dead ends: 251 [2018-09-30 10:36:44,925 INFO L226 Difference]: Without dead ends: 250 [2018-09-30 10:36:44,926 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-30 10:36:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-30 10:36:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-30 10:36:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-30 10:36:44,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-30 10:36:44,933 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-30 10:36:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:44,934 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-30 10:36:44,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-30 10:36:44,934 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-30 10:36:44,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-30 10:36:44,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:44,935 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-30 10:36:44,935 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:44,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:44,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-30 10:36:44,936 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:44,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:44,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:44,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:44,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:46,932 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-30 10:36:46,933 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:46,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 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-30 10:36:46,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:47,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:47,026 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-30 10:36:47,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:47,036 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-30 10:36:47,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:49,442 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-30 10:36:49,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:49,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-30 10:36:49,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-30 10:36:49,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-30 10:36:49,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 10:36:49,465 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-30 10:36:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:49,916 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-30 10:36:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-30 10:36:49,916 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-30 10:36:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:49,918 INFO L225 Difference]: With dead ends: 255 [2018-09-30 10:36:49,918 INFO L226 Difference]: Without dead ends: 254 [2018-09-30 10:36:49,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 10:36:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-30 10:36:49,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-30 10:36:49,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-30 10:36:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-30 10:36:49,924 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-30 10:36:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:49,924 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-30 10:36:49,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-30 10:36:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-30 10:36:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-30 10:36:49,925 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:49,926 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-30 10:36:49,926 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:49,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:49,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-30 10:36:49,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:49,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:49,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:49,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:36:49,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:51,991 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-30 10:36:51,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:51,992 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:51,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:36:52,067 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:36:52,067 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:52,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:52,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-30 10:36:52,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:52,087 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-30 10:36:52,087 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:36:54,812 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-30 10:36:54,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:36:54,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-30 10:36:54,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-30 10:36:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-30 10:36:54,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 10:36:54,837 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-30 10:36:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:36:55,292 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-30 10:36:55,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 10:36:55,293 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-30 10:36:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:36:55,295 INFO L225 Difference]: With dead ends: 259 [2018-09-30 10:36:55,295 INFO L226 Difference]: Without dead ends: 258 [2018-09-30 10:36:55,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-30 10:36:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-30 10:36:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-30 10:36:55,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-30 10:36:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-30 10:36:55,300 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-30 10:36:55,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:36:55,300 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-30 10:36:55,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-30 10:36:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-30 10:36:55,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-30 10:36:55,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:36:55,301 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-30 10:36:55,302 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:36:55,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:36:55,302 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-30 10:36:55,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:36:55,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:36:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:55,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:36:55,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:36:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:36:57,385 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-30 10:36:57,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:36:57,385 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:36:57,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:36:57,706 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-30 10:36:57,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:36:57,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:36:57,716 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-30 10:36:57,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:36:57,728 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-30 10:36:57,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:00,428 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-30 10:37:00,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:00,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-30 10:37:00,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-30 10:37:00,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-30 10:37:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 10:37:00,452 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-30 10:37:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:00,925 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-30 10:37:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 10:37:00,926 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-30 10:37:00,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:00,928 INFO L225 Difference]: With dead ends: 263 [2018-09-30 10:37:00,928 INFO L226 Difference]: Without dead ends: 262 [2018-09-30 10:37:00,929 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-30 10:37:00,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-30 10:37:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-30 10:37:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-30 10:37:00,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-30 10:37:00,934 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-30 10:37:00,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:00,934 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-30 10:37:00,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-30 10:37:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-30 10:37:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-30 10:37:00,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:00,936 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-30 10:37:00,936 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:00,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-30 10:37:00,937 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:00,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:00,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:00,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:00,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:03,028 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-30 10:37:03,029 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:03,029 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:37:03,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:37:03,120 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:37:03,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:03,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:03,137 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-30 10:37:03,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:03,150 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-30 10:37:03,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:06,198 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-30 10:37:06,220 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:06,220 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-30 10:37:06,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-30 10:37:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-30 10:37:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 10:37:06,222 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-30 10:37:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:06,709 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-30 10:37:06,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 10:37:06,709 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-30 10:37:06,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:06,711 INFO L225 Difference]: With dead ends: 267 [2018-09-30 10:37:06,711 INFO L226 Difference]: Without dead ends: 266 [2018-09-30 10:37:06,712 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-30 10:37:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-30 10:37:06,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-30 10:37:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-30 10:37:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-30 10:37:06,717 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-30 10:37:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:06,718 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-30 10:37:06,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-30 10:37:06,718 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-30 10:37:06,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-30 10:37:06,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:06,719 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-30 10:37:06,720 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:06,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:06,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-30 10:37:06,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:06,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:06,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:06,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:08,857 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-30 10:37:08,858 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:08,858 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-30 10:37:08,865 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:37:09,066 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-30 10:37:09,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:09,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:09,077 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-30 10:37:09,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:09,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-30 10:37:09,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:11,948 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-30 10:37:11,969 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:11,969 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-30 10:37:11,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-30 10:37:11,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-30 10:37:11,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 10:37:11,972 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-30 10:37:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:12,511 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-30 10:37:12,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-30 10:37:12,512 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-30 10:37:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:12,514 INFO L225 Difference]: With dead ends: 271 [2018-09-30 10:37:12,514 INFO L226 Difference]: Without dead ends: 270 [2018-09-30 10:37:12,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 10:37:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-30 10:37:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-30 10:37:12,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-30 10:37:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-30 10:37:12,520 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-30 10:37:12,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:12,520 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-30 10:37:12,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-30 10:37:12,520 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-30 10:37:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-30 10:37:12,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:12,522 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-30 10:37:12,522 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:12,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-30 10:37:12,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:12,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:12,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:12,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:14,954 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-30 10:37:14,954 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:14,954 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-30 10:37:14,962 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:37:15,277 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-30 10:37:15,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:15,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:15,286 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-30 10:37:15,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:15,297 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-30 10:37:15,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:17,944 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-30 10:37:17,965 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:17,965 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-30 10:37:17,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-30 10:37:17,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-30 10:37:17,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-30 10:37:17,968 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-30 10:37:18,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:18,542 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-30 10:37:18,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 10:37:18,543 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-30 10:37:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:18,545 INFO L225 Difference]: With dead ends: 275 [2018-09-30 10:37:18,545 INFO L226 Difference]: Without dead ends: 274 [2018-09-30 10:37:18,546 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-30 10:37:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-30 10:37:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-30 10:37:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-30 10:37:18,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-30 10:37:18,551 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-30 10:37:18,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:18,551 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-30 10:37:18,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-30 10:37:18,551 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-30 10:37:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-30 10:37:18,552 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:18,552 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-30 10:37:18,552 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:18,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:18,552 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-30 10:37:18,552 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:18,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:18,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:18,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:18,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:21,140 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-30 10:37:21,141 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:21,141 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:37:21,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:21,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:21,235 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-30 10:37:21,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:21,273 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-30 10:37:21,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:23,996 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-30 10:37:24,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:24,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-30 10:37:24,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-30 10:37:24,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-30 10:37:24,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-30 10:37:24,019 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-30 10:37:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:24,476 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-30 10:37:24,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-30 10:37:24,477 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-30 10:37:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:24,479 INFO L225 Difference]: With dead ends: 279 [2018-09-30 10:37:24,479 INFO L226 Difference]: Without dead ends: 278 [2018-09-30 10:37:24,481 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-30 10:37:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-30 10:37:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-30 10:37:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-30 10:37:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-30 10:37:24,486 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-30 10:37:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:24,486 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-30 10:37:24,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-30 10:37:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-30 10:37:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-30 10:37:24,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:24,488 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-30 10:37:24,488 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:24,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-30 10:37:24,489 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:24,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:24,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:37:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:27,135 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-30 10:37:27,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:27,136 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-30 10:37:27,142 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:37:27,222 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:37:27,223 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:27,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:27,232 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-30 10:37:27,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:27,245 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-30 10:37:27,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:30,384 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-30 10:37:30,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:30,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-30 10:37:30,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-30 10:37:30,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-30 10:37:30,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 10:37:30,409 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-30 10:37:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:30,998 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-30 10:37:30,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-30 10:37:30,999 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-30 10:37:30,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:31,000 INFO L225 Difference]: With dead ends: 283 [2018-09-30 10:37:31,001 INFO L226 Difference]: Without dead ends: 282 [2018-09-30 10:37:31,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-30 10:37:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-30 10:37:31,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-30 10:37:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-30 10:37:31,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-30 10:37:31,008 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-30 10:37:31,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:31,008 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-30 10:37:31,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-30 10:37:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-30 10:37:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-30 10:37:31,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:31,010 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-30 10:37:31,010 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:31,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:31,010 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-30 10:37:31,011 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:31,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:31,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:31,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:31,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:33,557 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-30 10:37:33,557 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:33,558 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-30 10:37:33,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:37:33,961 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-30 10:37:33,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:33,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:33,976 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-30 10:37:33,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:33,984 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-30 10:37:33,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:37,102 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-30 10:37:37,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:37,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-30 10:37:37,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-30 10:37:37,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-30 10:37:37,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 10:37:37,127 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-30 10:37:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:37,637 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-30 10:37:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 10:37:37,637 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-30 10:37:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:37,638 INFO L225 Difference]: With dead ends: 287 [2018-09-30 10:37:37,639 INFO L226 Difference]: Without dead ends: 286 [2018-09-30 10:37:37,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 10:37:37,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-30 10:37:37,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-30 10:37:37,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-30 10:37:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-30 10:37:37,645 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-30 10:37:37,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:37,645 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-30 10:37:37,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-30 10:37:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-30 10:37:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-30 10:37:37,646 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:37,646 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-30 10:37:37,646 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:37,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-30 10:37:37,647 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:37,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:37,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:37,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:37,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:40,268 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-30 10:37:40,268 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:40,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 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-30 10:37:40,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:37:40,367 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:37:40,367 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:40,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:40,382 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-30 10:37:40,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:40,390 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-30 10:37:40,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:43,290 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-30 10:37:43,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:43,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-30 10:37:43,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-30 10:37:43,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-30 10:37:43,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-30 10:37:43,314 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-30 10:37:43,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:43,907 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-30 10:37:43,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-30 10:37:43,908 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-30 10:37:43,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:43,910 INFO L225 Difference]: With dead ends: 291 [2018-09-30 10:37:43,910 INFO L226 Difference]: Without dead ends: 290 [2018-09-30 10:37:43,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-30 10:37:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-30 10:37:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-30 10:37:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-30 10:37:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-30 10:37:43,916 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-30 10:37:43,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:43,916 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-30 10:37:43,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-30 10:37:43,916 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-30 10:37:43,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-30 10:37:43,917 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:43,917 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-30 10:37:43,918 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:43,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:43,918 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-30 10:37:43,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:43,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:43,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:43,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:43,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:46,783 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-30 10:37:46,784 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:46,784 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-30 10:37:46,790 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:37:47,028 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-30 10:37:47,029 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:47,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:47,053 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-30 10:37:47,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:47,062 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-30 10:37:47,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:49,993 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-30 10:37:50,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:50,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-30 10:37:50,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-30 10:37:50,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-30 10:37:50,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-30 10:37:50,018 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-30 10:37:50,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:50,640 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-30 10:37:50,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-30 10:37:50,640 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-30 10:37:50,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:50,642 INFO L225 Difference]: With dead ends: 295 [2018-09-30 10:37:50,642 INFO L226 Difference]: Without dead ends: 294 [2018-09-30 10:37:50,644 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-30 10:37:50,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-30 10:37:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-30 10:37:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-30 10:37:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-30 10:37:50,649 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-30 10:37:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:50,649 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-30 10:37:50,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-30 10:37:50,649 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-30 10:37:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-30 10:37:50,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:50,650 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-30 10:37:50,651 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:50,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-30 10:37:50,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:50,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:50,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:50,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:37:53,323 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-30 10:37:53,323 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:37:53,323 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-30 10:37:53,334 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:37:53,704 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-30 10:37:53,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:37:53,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:37:53,715 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-30 10:37:53,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:37:53,723 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-30 10:37:53,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:37:57,019 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-30 10:37:57,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:37:57,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-30 10:37:57,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-30 10:37:57,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-30 10:37:57,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 10:37:57,042 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-30 10:37:57,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:37:57,529 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-30 10:37:57,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-30 10:37:57,529 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-30 10:37:57,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:37:57,531 INFO L225 Difference]: With dead ends: 299 [2018-09-30 10:37:57,531 INFO L226 Difference]: Without dead ends: 298 [2018-09-30 10:37:57,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-30 10:37:57,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-30 10:37:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-30 10:37:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-30 10:37:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-30 10:37:57,537 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-30 10:37:57,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:37:57,537 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-30 10:37:57,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-30 10:37:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-30 10:37:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-30 10:37:57,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:37:57,539 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-30 10:37:57,539 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:37:57,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:37:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-30 10:37:57,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:37:57,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:37:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:57,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:37:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:37:57,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:00,262 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-30 10:38:00,263 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:00,263 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-30 10:38:00,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:38:00,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:00,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:00,379 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-30 10:38:00,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:00,389 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-30 10:38:00,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:03,626 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-30 10:38:03,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:03,647 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-30 10:38:03,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-30 10:38:03,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-30 10:38:03,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-30 10:38:03,650 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-30 10:38:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:38:04,118 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-30 10:38:04,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-30 10:38:04,119 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-30 10:38:04,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:38:04,121 INFO L225 Difference]: With dead ends: 303 [2018-09-30 10:38:04,121 INFO L226 Difference]: Without dead ends: 302 [2018-09-30 10:38:04,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-30 10:38:04,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-30 10:38:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-30 10:38:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-30 10:38:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-30 10:38:04,129 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-30 10:38:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:38:04,129 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-30 10:38:04,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-30 10:38:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-30 10:38:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-30 10:38:04,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:38:04,131 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-30 10:38:04,131 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:38:04,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:38:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-30 10:38:04,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:38:04,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:38:04,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:04,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:38:04,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:06,840 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-30 10:38:06,840 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:06,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 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-30 10:38:06,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:38:06,929 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:38:06,929 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:06,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:06,939 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-30 10:38:06,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:06,951 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-30 10:38:06,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-30 10:38:10,182 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-30 10:38:10,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:38:10,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-30 10:38:10,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-30 10:38:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-30 10:38:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-30 10:38:10,206 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-30 10:38:10,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:38:10,714 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-30 10:38:10,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 10:38:10,714 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-30 10:38:10,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:38:10,716 INFO L225 Difference]: With dead ends: 307 [2018-09-30 10:38:10,716 INFO L226 Difference]: Without dead ends: 306 [2018-09-30 10:38:10,717 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-30 10:38:10,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-30 10:38:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-30 10:38:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-30 10:38:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-30 10:38:10,721 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-30 10:38:10,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:38:10,721 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-30 10:38:10,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-30 10:38:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-30 10:38:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-30 10:38:10,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:38:10,723 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-30 10:38:10,723 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:38:10,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 10:38:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-30 10:38:10,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:38:10,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:38:10,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:10,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:38:10,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:38:10,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:38:13,496 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-30 10:38:13,496 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:38:13,496 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-30 10:38:13,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:38:13,943 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-30 10:38:13,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:38:13,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:38:13,955 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-30 10:38:13,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 10:38:13,973 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-30 10:38:13,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-30 10:38:16,811 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-30 10:38:17,012 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:38:17,012 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 10:38:17,018 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 10:38:17,018 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 10:38:17 BoogieIcfgContainer [2018-09-30 10:38:17,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 10:38:17,019 INFO L168 Benchmark]: Toolchain (without parser) took 238364.73 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 521.9 MB. Max. memory is 7.1 GB. [2018-09-30 10:38:17,020 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:38:17,020 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:38:17,021 INFO L168 Benchmark]: Boogie Preprocessor took 27.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 10:38:17,021 INFO L168 Benchmark]: RCFGBuilder took 326.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 10:38:17,021 INFO L168 Benchmark]: TraceAbstraction took 237945.83 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 500.7 MB. Max. memory is 7.1 GB. [2018-09-30 10:38:17,023 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.55 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 27.71 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 326.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237945.83 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 500.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was analyzing trace of length 305 with TraceHistMax 76, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 150 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 237.8s OverallTime, 76 OverallIterations, 76 TraceHistogramMax, 23.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 227 SDtfs, 4157 SDslu, 4209 SDs, 0 SdLazy, 15681 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14172 GetRequests, 8473 SyntacticMatches, 0 SemanticMatches, 5699 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281200 ImplicationChecksByTransitivity, 179.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=305occurred in iteration=75, 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.3s AutomataMinimizationTime, 75 MinimizatonAttempts, 75 StatesRemovedByMinimization, 75 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 8.8s SatisfiabilityAnalysisTime, 191.9s InterpolantComputationTime, 22796 NumberOfCodeBlocks, 22796 NumberOfCodeBlocksAsserted, 1530 NumberOfCheckSat, 22647 ConstructedInterpolants, 0 QuantifiedInterpolants, 36359519 SizeOfPredicates, 444 NumberOfNonLiveVariables, 21127 ConjunctsInSsa, 9065 ConjunctsInUnsatCore, 149 InterpolantComputations, 1 PerfectInterpolantSequences, 0/556850 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-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_10-38-17-031.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_10-38-17-031.csv Completed graceful shutdown