java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:50:29,428 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:50:29,430 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:50:29,441 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:50:29,441 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:50:29,442 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:50:29,444 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:50:29,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:50:29,447 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:50:29,448 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:50:29,449 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:50:29,449 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:50:29,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:50:29,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:50:29,452 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:50:29,453 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:50:29,454 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:50:29,456 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:50:29,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:50:29,459 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:50:29,460 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:50:29,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:50:29,464 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:50:29,464 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:50:29,465 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:50:29,466 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:50:29,467 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:50:29,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:50:29,468 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:50:29,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:50:29,470 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:50:29,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:50:29,471 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:50:29,471 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:50:29,472 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:50:29,472 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:50:29,473 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 12:50:29,500 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:50:29,500 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:50:29,501 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:50:29,501 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:50:29,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:50:29,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:50:29,505 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:50:29,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:50:29,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:50:29,506 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:50:29,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:50:29,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:50:29,507 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:50:29,507 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:50:29,507 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:50:29,507 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:50:29,507 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:50:29,508 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:50:29,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:50:29,510 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:50:29,510 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:50:29,510 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:50:29,510 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:50:29,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:50:29,511 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:50:29,511 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:50:29,511 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:50:29,511 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:50:29,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:50:29,512 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:50:29,512 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 12:50:29,574 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:50:29,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:50:29,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:50:29,593 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:50:29,594 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:50:29,594 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl [2018-10-04 12:50:29,595 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-10-04 12:50:29,645 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:50:29,647 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:50:29,647 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:50:29,647 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:50:29,648 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:50:29,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:50:29,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:50:29,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:50:29,682 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:50:29,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,693 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... [2018-10-04 12:50:29,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:50:29,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:50:29,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:50:29,700 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:50:29,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:50:29,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:50:29,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:50:30,025 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:50:30,026 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:50:30 BoogieIcfgContainer [2018-10-04 12:50:30,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:50:30,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:50:30,028 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:50:30,031 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:50:30,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:50:29" (1/2) ... [2018-10-04 12:50:30,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcfeb36 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:50:30, skipping insertion in model container [2018-10-04 12:50:30,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:50:30" (2/2) ... [2018-10-04 12:50:30,036 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-10-04 12:50:30,046 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:50:30,057 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:50:30,108 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:50:30,109 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:50:30,109 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:50:30,109 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:50:30,109 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:50:30,110 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:50:30,110 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:50:30,110 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:50:30,110 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:50:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-10-04 12:50:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-04 12:50:30,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:30,134 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-04 12:50:30,135 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:30,141 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:30,142 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-04 12:50:30,144 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:30,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:30,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:30,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:30,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:30,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:50:30,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:50:30,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:50:30,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:50:30,332 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:30,334 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-10-04 12:50:30,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:30,413 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-10-04 12:50:30,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:50:30,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-04 12:50:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:30,431 INFO L225 Difference]: With dead ends: 14 [2018-10-04 12:50:30,432 INFO L226 Difference]: Without dead ends: 9 [2018-10-04 12:50:30,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 12:50:30,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-04 12:50:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-04 12:50:30,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-04 12:50:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-10-04 12:50:30,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 4 [2018-10-04 12:50:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:30,496 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-10-04 12:50:30,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:50:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-10-04 12:50:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-04 12:50:30,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:30,498 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-10-04 12:50:30,498 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:30,498 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1807905788, now seen corresponding path program 1 times [2018-10-04 12:50:30,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:30,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:30,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:30,585 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:30,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:30,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:30,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:50:30,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-04 12:50:30,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:50:30,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:50:30,684 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:30,684 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-10-04 12:50:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:30,762 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-10-04 12:50:30,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:50:30,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-10-04 12:50:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:30,766 INFO L225 Difference]: With dead ends: 20 [2018-10-04 12:50:30,766 INFO L226 Difference]: Without dead ends: 15 [2018-10-04 12:50:30,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 3 [2018-10-04 12:50:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-04 12:50:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-10-04 12:50:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 12:50:30,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-04 12:50:30,772 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 7 [2018-10-04 12:50:30,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:30,772 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-04 12:50:30,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:50:30,773 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-04 12:50:30,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 12:50:30,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:30,773 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1] [2018-10-04 12:50:30,774 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:30,774 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:30,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1839610074, now seen corresponding path program 1 times [2018-10-04 12:50:30,774 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:30,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:30,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:30,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:30,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:30,873 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:30,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:30,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:31,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:31,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:50:31,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:50:31,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:50:31,026 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:31,026 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-10-04 12:50:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:31,149 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-04 12:50:31,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:50:31,150 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-10-04 12:50:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:31,151 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:50:31,151 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:50:31,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 12:50:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:50:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-04 12:50:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:50:31,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-04 12:50:31,156 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-10-04 12:50:31,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:31,157 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-04 12:50:31,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:50:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-04 12:50:31,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:50:31,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:31,158 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1] [2018-10-04 12:50:31,158 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:31,158 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:31,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1731932091, now seen corresponding path program 2 times [2018-10-04 12:50:31,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:31,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:31,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:31,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:31,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:31,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:31,453 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:31,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:31,486 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:31,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:31,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:31,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 12:50:31,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 12:50:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 12:50:31,584 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:31,585 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-10-04 12:50:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:31,631 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-10-04 12:50:31,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:50:31,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-04 12:50:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:31,633 INFO L225 Difference]: With dead ends: 27 [2018-10-04 12:50:31,633 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:50:31,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 4 [2018-10-04 12:50:31,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:50:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 12:50:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 12:50:31,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-04 12:50:31,641 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-10-04 12:50:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:31,642 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-04 12:50:31,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 12:50:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-04 12:50:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 12:50:31,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:31,644 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1] [2018-10-04 12:50:31,645 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:31,645 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:31,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1975221498, now seen corresponding path program 3 times [2018-10-04 12:50:31,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:31,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:31,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:31,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:31,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:31,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:50:31,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:31,831 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:31,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:31,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-04 12:50:31,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:31,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:31,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-04 12:50:31,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:31,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-04 12:50:31,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:50:31,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:50:31,915 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:31,915 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2018-10-04 12:50:31,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:31,982 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-10-04 12:50:31,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:50:31,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-04 12:50:31,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:31,986 INFO L225 Difference]: With dead ends: 34 [2018-10-04 12:50:31,986 INFO L226 Difference]: Without dead ends: 27 [2018-10-04 12:50:31,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 7 [2018-10-04 12:50:31,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-04 12:50:31,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-10-04 12:50:31,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-04 12:50:31,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-10-04 12:50:31,993 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-10-04 12:50:31,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:31,993 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-10-04 12:50:31,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:50:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-10-04 12:50:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-04 12:50:31,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:31,995 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 5, 2, 1, 1, 1] [2018-10-04 12:50:31,995 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:31,995 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:31,996 INFO L82 PathProgramCache]: Analyzing trace with hash -2006868068, now seen corresponding path program 4 times [2018-10-04 12:50:31,996 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:31,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:31,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:31,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:32,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:32,154 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:50:32,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:32,155 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:32,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:32,174 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:32,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:32,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:50:32,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:32,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 12:50:32,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:50:32,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:50:32,298 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:32,298 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 8 states. [2018-10-04 12:50:32,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:32,386 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-10-04 12:50:32,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:50:32,387 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-10-04 12:50:32,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:32,388 INFO L225 Difference]: With dead ends: 39 [2018-10-04 12:50:32,388 INFO L226 Difference]: Without dead ends: 29 [2018-10-04 12:50:32,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 12:50:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-04 12:50:32,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-04 12:50:32,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-04 12:50:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-04 12:50:32,394 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 25 [2018-10-04 12:50:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:32,395 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-04 12:50:32,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:50:32,395 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-04 12:50:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-04 12:50:32,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:32,396 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 6, 2, 1, 1, 1] [2018-10-04 12:50:32,397 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:32,397 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:32,397 INFO L82 PathProgramCache]: Analyzing trace with hash -266768761, now seen corresponding path program 5 times [2018-10-04 12:50:32,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:32,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:32,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:32,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 35 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:50:32,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:32,716 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:32,742 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:50:32,884 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 12:50:32,884 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:32,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:33,088 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 35 proven. 63 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:50:33,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:33,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 12:50:33,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 12:50:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 12:50:33,111 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:33,111 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 9 states. [2018-10-04 12:50:33,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:33,166 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-10-04 12:50:33,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:50:33,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-04 12:50:33,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:33,167 INFO L225 Difference]: With dead ends: 42 [2018-10-04 12:50:33,167 INFO L226 Difference]: Without dead ends: 32 [2018-10-04 12:50:33,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 7 [2018-10-04 12:50:33,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-04 12:50:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-04 12:50:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:50:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-04 12:50:33,175 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 28 [2018-10-04 12:50:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:33,175 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-04 12:50:33,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 12:50:33,175 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-04 12:50:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:50:33,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:33,177 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 7, 2, 1, 1, 1] [2018-10-04 12:50:33,177 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:33,177 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:33,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1223576644, now seen corresponding path program 6 times [2018-10-04 12:50:33,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:33,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:33,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:33,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 84 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-04 12:50:33,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:33,368 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:33,377 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:50:33,396 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-10-04 12:50:33,397 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:33,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:33,475 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 56 proven. 7 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-10-04 12:50:33,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:33,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 13 [2018-10-04 12:50:33,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-04 12:50:33,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-04 12:50:33,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:33,505 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 13 states. [2018-10-04 12:50:33,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:33,639 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-10-04 12:50:33,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:50:33,639 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-10-04 12:50:33,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:33,640 INFO L225 Difference]: With dead ends: 49 [2018-10-04 12:50:33,641 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 12:50:33,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 11 [2018-10-04 12:50:33,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 12:50:33,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-04 12:50:33,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 12:50:33,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-10-04 12:50:33,648 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 31 [2018-10-04 12:50:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:33,649 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-10-04 12:50:33,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-04 12:50:33,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-10-04 12:50:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 12:50:33,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:33,651 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 8, 3, 1, 1, 1] [2018-10-04 12:50:33,651 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:33,651 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:33,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1547890150, now seen corresponding path program 7 times [2018-10-04 12:50:33,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:33,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:33,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:33,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 12:50:33,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:33,819 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:33,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:33,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 72 proven. 108 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 12:50:33,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:33,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 12:50:33,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 12:50:33,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 12:50:33,956 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:33,956 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2018-10-04 12:50:34,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:34,115 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-10-04 12:50:34,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:50:34,116 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-04 12:50:34,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:34,117 INFO L225 Difference]: With dead ends: 54 [2018-10-04 12:50:34,117 INFO L226 Difference]: Without dead ends: 41 [2018-10-04 12:50:34,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 9 [2018-10-04 12:50:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-04 12:50:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-04 12:50:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-04 12:50:34,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-10-04 12:50:34,124 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 37 [2018-10-04 12:50:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:34,125 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-10-04 12:50:34,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 12:50:34,125 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-10-04 12:50:34,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-04 12:50:34,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:34,126 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 9, 3, 1, 1, 1] [2018-10-04 12:50:34,127 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:34,127 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:34,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1837705083, now seen corresponding path program 8 times [2018-10-04 12:50:34,127 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:34,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:34,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:34,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:34,318 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 80 proven. 135 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 12:50:34,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:34,319 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:34,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:34,348 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:34,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:34,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:34,433 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 80 proven. 135 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 12:50:34,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:34,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 12:50:34,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:50:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:50:34,455 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:34,456 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2018-10-04 12:50:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:34,514 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-10-04 12:50:34,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:50:34,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2018-10-04 12:50:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:34,515 INFO L225 Difference]: With dead ends: 57 [2018-10-04 12:50:34,516 INFO L226 Difference]: Without dead ends: 44 [2018-10-04 12:50:34,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 10 [2018-10-04 12:50:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-04 12:50:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-04 12:50:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-04 12:50:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2018-10-04 12:50:34,523 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 40 [2018-10-04 12:50:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:34,524 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2018-10-04 12:50:34,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:50:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2018-10-04 12:50:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-04 12:50:34,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:34,525 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 10, 3, 1, 1, 1] [2018-10-04 12:50:34,525 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:34,525 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1464858170, now seen corresponding path program 9 times [2018-10-04 12:50:34,526 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:34,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:34,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 88 proven. 165 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-04 12:50:34,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:34,674 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:34,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:34,696 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-04 12:50:34,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:34,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 110 proven. 15 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2018-10-04 12:50:34,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:34,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 17 [2018-10-04 12:50:34,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:50:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:50:34,806 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:34,806 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 17 states. [2018-10-04 12:50:34,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:34,921 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-10-04 12:50:34,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:50:34,921 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-10-04 12:50:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:34,923 INFO L225 Difference]: With dead ends: 64 [2018-10-04 12:50:34,923 INFO L226 Difference]: Without dead ends: 51 [2018-10-04 12:50:34,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.1s impTime 15 [2018-10-04 12:50:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-04 12:50:34,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-04 12:50:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 12:50:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-10-04 12:50:34,933 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 43 [2018-10-04 12:50:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:34,933 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-10-04 12:50:34,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:50:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-10-04 12:50:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-04 12:50:34,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:34,934 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 11, 4, 1, 1, 1] [2018-10-04 12:50:34,935 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:34,935 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 469061468, now seen corresponding path program 10 times [2018-10-04 12:50:34,935 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:34,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:34,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:34,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:34,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 12:50:35,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:35,134 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:35,142 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:35,162 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:35,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:35,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 132 proven. 198 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 12:50:35,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:35,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 12:50:35,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:50:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:50:35,392 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:35,392 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 14 states. [2018-10-04 12:50:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:35,496 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2018-10-04 12:50:35,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:50:35,498 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 49 [2018-10-04 12:50:35,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:35,500 INFO L225 Difference]: With dead ends: 69 [2018-10-04 12:50:35,500 INFO L226 Difference]: Without dead ends: 53 [2018-10-04 12:50:35,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 12 [2018-10-04 12:50:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-04 12:50:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-04 12:50:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-04 12:50:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-10-04 12:50:35,507 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 49 [2018-10-04 12:50:35,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:35,508 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-10-04 12:50:35,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:50:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-10-04 12:50:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-04 12:50:35,509 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:35,509 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 12, 4, 1, 1, 1] [2018-10-04 12:50:35,510 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:35,510 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash -990261945, now seen corresponding path program 11 times [2018-10-04 12:50:35,510 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:35,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:35,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 12:50:35,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:35,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:35,688 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:50:35,718 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-10-04 12:50:35,718 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:35,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 143 proven. 234 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 12:50:35,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:35,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 12:50:35,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 12:50:35,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 12:50:35,882 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:35,882 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 15 states. [2018-10-04 12:50:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:35,948 INFO L93 Difference]: Finished difference Result 72 states and 81 transitions. [2018-10-04 12:50:35,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:50:35,948 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2018-10-04 12:50:35,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:35,949 INFO L225 Difference]: With dead ends: 72 [2018-10-04 12:50:35,949 INFO L226 Difference]: Without dead ends: 56 [2018-10-04 12:50:35,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 13 [2018-10-04 12:50:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-04 12:50:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-04 12:50:35,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-04 12:50:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-10-04 12:50:35,957 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 52 [2018-10-04 12:50:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:35,957 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-10-04 12:50:35,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 12:50:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-10-04 12:50:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-04 12:50:35,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:35,959 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 13, 4, 1, 1, 1] [2018-10-04 12:50:35,959 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:35,959 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:35,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2035088516, now seen corresponding path program 12 times [2018-10-04 12:50:35,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:35,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:35,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:35,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:35,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:36,317 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 154 proven. 273 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-04 12:50:36,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:36,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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:36,328 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:50:36,473 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2018-10-04 12:50:36,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:36,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:36,892 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 182 proven. 26 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-10-04 12:50:36,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:36,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 21 [2018-10-04 12:50:36,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:50:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:50:36,919 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:36,919 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 21 states. [2018-10-04 12:50:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:37,038 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2018-10-04 12:50:37,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:50:37,039 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-04 12:50:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:37,040 INFO L225 Difference]: With dead ends: 79 [2018-10-04 12:50:37,040 INFO L226 Difference]: Without dead ends: 63 [2018-10-04 12:50:37,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.5s impTime 6 [2018-10-04 12:50:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-04 12:50:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-04 12:50:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 12:50:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-10-04 12:50:37,050 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 55 [2018-10-04 12:50:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:37,051 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-10-04 12:50:37,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:50:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-10-04 12:50:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 12:50:37,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:37,052 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 14, 5, 1, 1, 1] [2018-10-04 12:50:37,052 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:37,052 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1900338010, now seen corresponding path program 13 times [2018-10-04 12:50:37,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:37,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:37,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:37,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:37,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 12:50:37,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:37,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:37,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:37,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 210 proven. 315 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 12:50:37,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 12:50:37,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 12:50:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 12:50:37,683 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:37,683 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 17 states. [2018-10-04 12:50:37,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:37,900 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-10-04 12:50:37,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:50:37,901 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-04 12:50:37,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:37,902 INFO L225 Difference]: With dead ends: 84 [2018-10-04 12:50:37,902 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 12:50:37,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.1s impTime 15 [2018-10-04 12:50:37,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 12:50:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-04 12:50:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-04 12:50:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-10-04 12:50:37,910 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 61 [2018-10-04 12:50:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:37,911 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-10-04 12:50:37,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 12:50:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-10-04 12:50:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-04 12:50:37,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:37,912 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 15, 5, 1, 1, 1] [2018-10-04 12:50:37,913 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:37,913 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1598238523, now seen corresponding path program 14 times [2018-10-04 12:50:37,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:37,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:37,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:37,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 224 proven. 360 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 12:50:38,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:38,147 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:38,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:38,174 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:38,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:38,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:38,304 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 224 proven. 360 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 12:50:38,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:38,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 12:50:38,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:50:38,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:50:38,325 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:38,325 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 18 states. [2018-10-04 12:50:38,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:38,472 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-10-04 12:50:38,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:50:38,473 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-10-04 12:50:38,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:38,474 INFO L225 Difference]: With dead ends: 87 [2018-10-04 12:50:38,474 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 12:50:38,475 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 16 [2018-10-04 12:50:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 12:50:38,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 12:50:38,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 12:50:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-10-04 12:50:38,483 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 64 [2018-10-04 12:50:38,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:38,483 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-10-04 12:50:38,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:50:38,484 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-10-04 12:50:38,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 12:50:38,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:38,485 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 16, 5, 1, 1, 1] [2018-10-04 12:50:38,485 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:38,485 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:38,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1720361094, now seen corresponding path program 15 times [2018-10-04 12:50:38,486 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:38,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:38,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:38,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:38,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 238 proven. 408 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-04 12:50:38,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:38,843 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:38,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:38,863 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-04 12:50:38,863 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:38,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:38,920 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:39,021 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 272 proven. 40 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-04 12:50:39,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:39,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 25 [2018-10-04 12:50:39,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-04 12:50:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-04 12:50:39,042 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:39,042 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 25 states. [2018-10-04 12:50:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:39,298 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2018-10-04 12:50:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:50:39,299 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 67 [2018-10-04 12:50:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:39,300 INFO L225 Difference]: With dead ends: 94 [2018-10-04 12:50:39,300 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:50:39,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 10 [2018-10-04 12:50:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:50:39,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-04 12:50:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:50:39,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2018-10-04 12:50:39,307 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 67 [2018-10-04 12:50:39,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:39,307 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2018-10-04 12:50:39,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-04 12:50:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2018-10-04 12:50:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 12:50:39,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:39,308 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 17, 6, 1, 1, 1] [2018-10-04 12:50:39,309 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:39,309 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:39,309 INFO L82 PathProgramCache]: Analyzing trace with hash -867234020, now seen corresponding path program 16 times [2018-10-04 12:50:39,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:39,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:39,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 459 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 12:50:39,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:39,615 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:39,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:39,656 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:39,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:39,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:39,770 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 306 proven. 459 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 12:50:39,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:39,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 12:50:39,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:50:39,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:50:39,790 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:39,790 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand 20 states. [2018-10-04 12:50:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:39,856 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2018-10-04 12:50:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:50:39,856 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 73 [2018-10-04 12:50:39,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:39,857 INFO L225 Difference]: With dead ends: 99 [2018-10-04 12:50:39,857 INFO L226 Difference]: Without dead ends: 77 [2018-10-04 12:50:39,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 18 [2018-10-04 12:50:39,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-04 12:50:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-04 12:50:39,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:50:39,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2018-10-04 12:50:39,862 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 73 [2018-10-04 12:50:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:39,863 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2018-10-04 12:50:39,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:50:39,863 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2018-10-04 12:50:39,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 12:50:39,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:39,864 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 18, 6, 1, 1, 1] [2018-10-04 12:50:39,864 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:39,864 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:39,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1757201401, now seen corresponding path program 17 times [2018-10-04 12:50:39,865 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:39,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:39,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:39,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:39,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:40,664 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 323 proven. 513 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 12:50:40,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:40,668 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:40,676 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:50:40,753 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-04 12:50:40,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:40,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 323 proven. 513 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 12:50:41,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:41,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 12:50:41,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 12:50:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 12:50:41,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:41,022 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand 21 states. [2018-10-04 12:50:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:41,138 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2018-10-04 12:50:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:50:41,138 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2018-10-04 12:50:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:41,139 INFO L225 Difference]: With dead ends: 102 [2018-10-04 12:50:41,140 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 12:50:41,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 6 [2018-10-04 12:50:41,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 12:50:41,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 12:50:41,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 12:50:41,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-10-04 12:50:41,145 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 76 [2018-10-04 12:50:41,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:41,145 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-10-04 12:50:41,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 12:50:41,146 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-10-04 12:50:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 12:50:41,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:41,146 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 19, 6, 1, 1, 1] [2018-10-04 12:50:41,147 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:41,147 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1942330564, now seen corresponding path program 18 times [2018-10-04 12:50:41,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:41,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:41,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:41,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:41,448 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 340 proven. 570 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 12:50:41,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:41,480 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:41,488 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:50:41,525 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2018-10-04 12:50:41,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:41,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 380 proven. 57 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-10-04 12:50:41,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:41,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 9] total 29 [2018-10-04 12:50:41,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:50:41,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:50:41,715 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:41,715 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 29 states. [2018-10-04 12:50:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:41,870 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-10-04 12:50:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:50:41,871 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-10-04 12:50:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:41,872 INFO L225 Difference]: With dead ends: 109 [2018-10-04 12:50:41,872 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 12:50:41,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 14 [2018-10-04 12:50:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 12:50:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-04 12:50:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 12:50:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2018-10-04 12:50:41,880 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 79 [2018-10-04 12:50:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:41,880 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2018-10-04 12:50:41,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:50:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2018-10-04 12:50:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 12:50:41,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:41,882 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 20, 7, 1, 1, 1] [2018-10-04 12:50:41,882 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:41,882 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:41,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1524001638, now seen corresponding path program 19 times [2018-10-04 12:50:41,883 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:41,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:41,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:41,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:41,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:42,264 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 420 proven. 630 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 12:50:42,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:42,309 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:42,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:42,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 420 proven. 630 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 12:50:42,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:42,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 12:50:42,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 12:50:42,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 12:50:42,510 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:42,510 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand 23 states. [2018-10-04 12:50:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:42,618 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-10-04 12:50:42,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:50:42,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-04 12:50:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:42,620 INFO L225 Difference]: With dead ends: 114 [2018-10-04 12:50:42,620 INFO L226 Difference]: Without dead ends: 89 [2018-10-04 12:50:42,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 8 [2018-10-04 12:50:42,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-04 12:50:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-10-04 12:50:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-04 12:50:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-10-04 12:50:42,625 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 85 [2018-10-04 12:50:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:42,626 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-10-04 12:50:42,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 12:50:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-10-04 12:50:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-04 12:50:42,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:42,627 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 21, 7, 1, 1, 1] [2018-10-04 12:50:42,627 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:42,627 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:42,627 INFO L82 PathProgramCache]: Analyzing trace with hash 427997445, now seen corresponding path program 20 times [2018-10-04 12:50:42,628 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:42,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:42,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:42,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:42,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:42,853 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:42,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 440 proven. 693 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 12:50:42,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:42,885 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:42,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:42,940 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:42,940 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:42,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 440 proven. 693 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 12:50:43,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:43,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 12:50:43,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:50:43,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:50:43,220 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:43,220 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 24 states. [2018-10-04 12:50:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:43,396 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-10-04 12:50:43,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:50:43,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 88 [2018-10-04 12:50:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:43,398 INFO L225 Difference]: With dead ends: 117 [2018-10-04 12:50:43,398 INFO L226 Difference]: Without dead ends: 92 [2018-10-04 12:50:43,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.1s impTime 9 [2018-10-04 12:50:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-04 12:50:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-10-04 12:50:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 12:50:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2018-10-04 12:50:43,404 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 88 [2018-10-04 12:50:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:43,404 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2018-10-04 12:50:43,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:50:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2018-10-04 12:50:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 12:50:43,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:43,405 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 22, 7, 1, 1, 1] [2018-10-04 12:50:43,405 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:43,405 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1424508742, now seen corresponding path program 21 times [2018-10-04 12:50:43,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:43,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:43,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:43,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:43,640 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 460 proven. 759 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-04 12:50:43,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:43,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:43,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:43,731 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-04 12:50:43,731 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:43,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 506 proven. 77 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-10-04 12:50:43,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:43,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 33 [2018-10-04 12:50:43,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:50:43,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:50:43,909 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:43,909 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand 33 states. [2018-10-04 12:50:44,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:44,100 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-10-04 12:50:44,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:50:44,108 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 91 [2018-10-04 12:50:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:44,109 INFO L225 Difference]: With dead ends: 124 [2018-10-04 12:50:44,109 INFO L226 Difference]: Without dead ends: 99 [2018-10-04 12:50:44,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 18 [2018-10-04 12:50:44,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-04 12:50:44,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-04 12:50:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-04 12:50:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2018-10-04 12:50:44,116 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 91 [2018-10-04 12:50:44,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:44,116 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2018-10-04 12:50:44,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:50:44,116 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2018-10-04 12:50:44,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-04 12:50:44,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:44,117 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 23, 8, 1, 1, 1] [2018-10-04 12:50:44,118 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:44,118 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:44,118 INFO L82 PathProgramCache]: Analyzing trace with hash 201514716, now seen corresponding path program 22 times [2018-10-04 12:50:44,118 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:44,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:44,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:44,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:44,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:44,463 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 552 proven. 828 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 12:50:44,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:44,542 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:44,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:44,577 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:44,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:44,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 552 proven. 828 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 12:50:44,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:44,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 12:50:44,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:50:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:50:44,724 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:44,724 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand 26 states. [2018-10-04 12:50:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:44,808 INFO L93 Difference]: Finished difference Result 129 states and 146 transitions. [2018-10-04 12:50:44,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:50:44,809 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 97 [2018-10-04 12:50:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:44,810 INFO L225 Difference]: With dead ends: 129 [2018-10-04 12:50:44,810 INFO L226 Difference]: Without dead ends: 101 [2018-10-04 12:50:44,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 11 [2018-10-04 12:50:44,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-04 12:50:44,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-10-04 12:50:44,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-04 12:50:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2018-10-04 12:50:44,816 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 97 [2018-10-04 12:50:44,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:44,817 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2018-10-04 12:50:44,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:50:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2018-10-04 12:50:44,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-04 12:50:44,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:44,818 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 24, 8, 1, 1, 1] [2018-10-04 12:50:44,818 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:44,818 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:44,818 INFO L82 PathProgramCache]: Analyzing trace with hash -527844665, now seen corresponding path program 23 times [2018-10-04 12:50:44,818 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:44,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:44,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:44,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:45,063 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 575 proven. 900 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 12:50:45,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:45,145 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:45,153 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:50:45,213 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-10-04 12:50:45,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:45,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 575 proven. 900 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 12:50:45,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:45,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 12:50:45,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 12:50:45,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 12:50:45,420 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:45,421 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 27 states. [2018-10-04 12:50:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:45,551 INFO L93 Difference]: Finished difference Result 132 states and 149 transitions. [2018-10-04 12:50:45,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:50:45,551 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 100 [2018-10-04 12:50:45,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:45,552 INFO L225 Difference]: With dead ends: 132 [2018-10-04 12:50:45,553 INFO L226 Difference]: Without dead ends: 104 [2018-10-04 12:50:45,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 12 [2018-10-04 12:50:45,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-04 12:50:45,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-10-04 12:50:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-04 12:50:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2018-10-04 12:50:45,559 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 100 [2018-10-04 12:50:45,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:45,559 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2018-10-04 12:50:45,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 12:50:45,559 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2018-10-04 12:50:45,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-04 12:50:45,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:45,560 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 25, 8, 1, 1, 1] [2018-10-04 12:50:45,560 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:45,561 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:45,561 INFO L82 PathProgramCache]: Analyzing trace with hash -633613572, now seen corresponding path program 24 times [2018-10-04 12:50:45,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:45,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:45,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:45,923 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:46,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 598 proven. 975 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-10-04 12:50:46,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:46,112 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:46,120 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:50:46,163 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2018-10-04 12:50:46,163 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:46,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:46,330 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:50:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 650 proven. 100 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2018-10-04 12:50:46,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:46,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 11] total 37 [2018-10-04 12:50:46,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 12:50:46,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 12:50:46,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:46,378 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 37 states. [2018-10-04 12:50:46,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:46,599 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-10-04 12:50:46,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:50:46,599 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 103 [2018-10-04 12:50:46,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:46,600 INFO L225 Difference]: With dead ends: 139 [2018-10-04 12:50:46,600 INFO L226 Difference]: Without dead ends: 111 [2018-10-04 12:50:46,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 7 [2018-10-04 12:50:46,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-04 12:50:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-04 12:50:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-04 12:50:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2018-10-04 12:50:46,606 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 103 [2018-10-04 12:50:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:46,607 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2018-10-04 12:50:46,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 12:50:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2018-10-04 12:50:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-04 12:50:46,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:46,607 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 26, 9, 1, 1, 1] [2018-10-04 12:50:46,607 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:46,608 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash 223821274, now seen corresponding path program 25 times [2018-10-04 12:50:46,608 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:46,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:46,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:46,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:46,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:47,804 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 702 proven. 1053 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 12:50:47,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:47,875 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:47,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:47,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 702 proven. 1053 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 12:50:48,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:48,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 12:50:48,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 12:50:48,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 12:50:48,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:48,077 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 29 states. [2018-10-04 12:50:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:48,204 INFO L93 Difference]: Finished difference Result 144 states and 163 transitions. [2018-10-04 12:50:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:50:48,205 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-10-04 12:50:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:48,206 INFO L225 Difference]: With dead ends: 144 [2018-10-04 12:50:48,206 INFO L226 Difference]: Without dead ends: 113 [2018-10-04 12:50:48,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime 14 [2018-10-04 12:50:48,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-04 12:50:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-10-04 12:50:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-04 12:50:48,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-10-04 12:50:48,211 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 109 [2018-10-04 12:50:48,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:48,212 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-10-04 12:50:48,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 12:50:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-10-04 12:50:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-04 12:50:48,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:48,212 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 27, 9, 1, 1, 1] [2018-10-04 12:50:48,212 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:48,212 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1370788165, now seen corresponding path program 26 times [2018-10-04 12:50:48,213 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:48,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:48,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:48,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:48,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:49,097 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:49,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 728 proven. 1134 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 12:50:49,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:49,270 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:49,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:49,304 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:49,304 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:49,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 728 proven. 1134 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 12:50:49,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:49,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 12:50:49,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:50:49,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:50:49,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:49,498 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 30 states. [2018-10-04 12:50:49,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:49,688 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2018-10-04 12:50:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:50:49,689 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 112 [2018-10-04 12:50:49,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:49,689 INFO L225 Difference]: With dead ends: 147 [2018-10-04 12:50:49,690 INFO L226 Difference]: Without dead ends: 116 [2018-10-04 12:50:49,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 15 [2018-10-04 12:50:49,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-04 12:50:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-10-04 12:50:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-04 12:50:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-10-04 12:50:49,694 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 112 [2018-10-04 12:50:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:49,694 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-10-04 12:50:49,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:50:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-10-04 12:50:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-04 12:50:49,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:49,695 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 28, 9, 1, 1, 1] [2018-10-04 12:50:49,695 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:49,695 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:49,696 INFO L82 PathProgramCache]: Analyzing trace with hash -98369030, now seen corresponding path program 27 times [2018-10-04 12:50:49,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:49,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:49,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:49,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:49,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:50,015 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 754 proven. 1218 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-10-04 12:50:50,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:50,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:50,240 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:50,265 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-04 12:50:50,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:50,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:50,390 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:50:50,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 812 proven. 126 refuted. 0 times theorem prover too weak. 1134 trivial. 0 not checked. [2018-10-04 12:50:50,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:50,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 12] total 41 [2018-10-04 12:50:50,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:50:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:50:50,449 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:50,449 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 41 states. [2018-10-04 12:50:50,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:50,655 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-10-04 12:50:50,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:50:50,655 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 115 [2018-10-04 12:50:50,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:50,657 INFO L225 Difference]: With dead ends: 154 [2018-10-04 12:50:50,657 INFO L226 Difference]: Without dead ends: 123 [2018-10-04 12:50:50,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.4s impTime 10 [2018-10-04 12:50:50,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-04 12:50:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-10-04 12:50:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-04 12:50:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2018-10-04 12:50:50,664 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 115 [2018-10-04 12:50:50,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:50,664 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2018-10-04 12:50:50,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:50:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2018-10-04 12:50:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-04 12:50:50,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:50,665 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 29, 10, 1, 1, 1] [2018-10-04 12:50:50,665 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:50,666 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash -291193188, now seen corresponding path program 28 times [2018-10-04 12:50:50,666 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:50,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:50,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:50,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:51,011 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:51,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 870 proven. 1305 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 12:50:51,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:51,214 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:51,221 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:51,250 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:51,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:51,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:51,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 870 proven. 1305 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 12:50:51,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:51,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 12:50:51,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:50:51,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:50:51,465 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:51,465 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 32 states. [2018-10-04 12:50:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:51,620 INFO L93 Difference]: Finished difference Result 159 states and 180 transitions. [2018-10-04 12:50:51,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:50:51,620 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 121 [2018-10-04 12:50:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:51,621 INFO L225 Difference]: With dead ends: 159 [2018-10-04 12:50:51,621 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 12:50:51,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 17 [2018-10-04 12:50:51,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 12:50:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-10-04 12:50:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-04 12:50:51,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2018-10-04 12:50:51,629 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 121 [2018-10-04 12:50:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:51,629 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2018-10-04 12:50:51,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:50:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2018-10-04 12:50:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-04 12:50:51,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:51,630 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 30, 10, 1, 1, 1] [2018-10-04 12:50:51,630 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:51,631 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1151252089, now seen corresponding path program 29 times [2018-10-04 12:50:51,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:51,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:51,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:51,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:51,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:52,098 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:52,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 899 proven. 1395 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 12:50:52,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:52,430 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:52,440 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:50:52,506 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2018-10-04 12:50:52,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:52,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 899 proven. 1395 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 12:50:52,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:52,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 12:50:52,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 12:50:52,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 12:50:52,728 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:52,728 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand 33 states. [2018-10-04 12:50:52,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:52,856 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2018-10-04 12:50:52,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:50:52,857 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-10-04 12:50:52,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:52,858 INFO L225 Difference]: With dead ends: 162 [2018-10-04 12:50:52,858 INFO L226 Difference]: Without dead ends: 128 [2018-10-04 12:50:52,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 18 [2018-10-04 12:50:52,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-04 12:50:52,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-10-04 12:50:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-04 12:50:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-10-04 12:50:52,864 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 124 [2018-10-04 12:50:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:52,865 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-10-04 12:50:52,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 12:50:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-10-04 12:50:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-04 12:50:52,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:52,866 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 31, 10, 1, 1, 1] [2018-10-04 12:50:52,866 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:52,866 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:52,866 INFO L82 PathProgramCache]: Analyzing trace with hash 608916156, now seen corresponding path program 30 times [2018-10-04 12:50:52,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:52,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:52,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:52,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:52,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:53,971 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:54,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 928 proven. 1488 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2018-10-04 12:50:54,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:54,288 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:54,295 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:50:54,346 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2018-10-04 12:50:54,346 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:54,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:54,523 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:50:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 992 proven. 155 refuted. 0 times theorem prover too weak. 1395 trivial. 0 not checked. [2018-10-04 12:50:54,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:54,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 13] total 45 [2018-10-04 12:50:54,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:50:54,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:50:54,634 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:54,634 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 45 states. [2018-10-04 12:50:54,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:54,909 INFO L93 Difference]: Finished difference Result 169 states and 193 transitions. [2018-10-04 12:50:54,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:50:54,909 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 127 [2018-10-04 12:50:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:54,911 INFO L225 Difference]: With dead ends: 169 [2018-10-04 12:50:54,911 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 12:50:54,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.2s impTime 15 [2018-10-04 12:50:54,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 12:50:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-10-04 12:50:54,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-04 12:50:54,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2018-10-04 12:50:54,918 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 127 [2018-10-04 12:50:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:54,919 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2018-10-04 12:50:54,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:50:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2018-10-04 12:50:54,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-04 12:50:54,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:54,920 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 32, 11, 1, 1, 1] [2018-10-04 12:50:54,920 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:54,920 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:54,920 INFO L82 PathProgramCache]: Analyzing trace with hash 918148890, now seen corresponding path program 31 times [2018-10-04 12:50:54,920 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:54,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:54,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:54,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:55,130 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:55,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1056 proven. 1584 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 12:50:55,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:55,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:55,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:55,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 1056 proven. 1584 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 12:50:55,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:55,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 12:50:55,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 12:50:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 12:50:55,537 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:55,538 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand 35 states. [2018-10-04 12:50:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:55,690 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-10-04 12:50:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:50:55,691 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 133 [2018-10-04 12:50:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:55,692 INFO L225 Difference]: With dead ends: 174 [2018-10-04 12:50:55,692 INFO L226 Difference]: Without dead ends: 137 [2018-10-04 12:50:55,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 20 [2018-10-04 12:50:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-04 12:50:55,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-10-04 12:50:55,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-04 12:50:55,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2018-10-04 12:50:55,699 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 133 [2018-10-04 12:50:55,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:55,699 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2018-10-04 12:50:55,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 12:50:55,700 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2018-10-04 12:50:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 12:50:55,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:55,700 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 33, 11, 1, 1, 1] [2018-10-04 12:50:55,701 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:55,701 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1564367237, now seen corresponding path program 32 times [2018-10-04 12:50:55,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:55,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:55,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:50:55,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:56,065 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:56,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1088 proven. 1683 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 12:50:56,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:56,223 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:56,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:50:56,264 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:50:56,264 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:56,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1088 proven. 1683 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 12:50:56,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:56,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 12:50:56,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:50:56,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:50:56,452 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:56,453 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand 36 states. [2018-10-04 12:50:56,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:56,841 INFO L93 Difference]: Finished difference Result 177 states and 200 transitions. [2018-10-04 12:50:56,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:50:56,841 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 136 [2018-10-04 12:50:56,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:56,842 INFO L225 Difference]: With dead ends: 177 [2018-10-04 12:50:56,842 INFO L226 Difference]: Without dead ends: 140 [2018-10-04 12:50:56,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time 0.3s impTime 21 [2018-10-04 12:50:56,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-04 12:50:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-04 12:50:56,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-04 12:50:56,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 151 transitions. [2018-10-04 12:50:56,849 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 151 transitions. Word has length 136 [2018-10-04 12:50:56,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:56,849 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 151 transitions. [2018-10-04 12:50:56,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:50:56,849 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2018-10-04 12:50:56,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-04 12:50:56,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:56,850 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 34, 11, 1, 1, 1] [2018-10-04 12:50:56,850 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:56,851 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:56,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1283245254, now seen corresponding path program 33 times [2018-10-04 12:50:56,851 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:56,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:56,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:56,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:56,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:57,274 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:57,810 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:50:57,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1120 proven. 1785 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2018-10-04 12:50:57,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:57,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:57,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:50:57,866 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-04 12:50:57,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:57,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:50:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 1190 proven. 187 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2018-10-04 12:50:58,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:50:58,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 49 [2018-10-04 12:50:58,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-04 12:50:58,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-04 12:50:58,731 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:50:58,731 INFO L87 Difference]: Start difference. First operand 140 states and 151 transitions. Second operand 49 states. [2018-10-04 12:50:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:50:58,958 INFO L93 Difference]: Finished difference Result 184 states and 210 transitions. [2018-10-04 12:50:58,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:50:58,959 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 139 [2018-10-04 12:50:58,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:50:58,960 INFO L225 Difference]: With dead ends: 184 [2018-10-04 12:50:58,960 INFO L226 Difference]: Without dead ends: 147 [2018-10-04 12:50:58,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.0s impTime 19 [2018-10-04 12:50:58,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-04 12:50:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-04 12:50:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-04 12:50:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 158 transitions. [2018-10-04 12:50:58,968 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 158 transitions. Word has length 139 [2018-10-04 12:50:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:50:58,968 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 158 transitions. [2018-10-04 12:50:58,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-04 12:50:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 158 transitions. [2018-10-04 12:50:58,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-04 12:50:58,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:50:58,969 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 35, 12, 1, 1, 1] [2018-10-04 12:50:58,969 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:50:58,969 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:50:58,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1757982300, now seen corresponding path program 34 times [2018-10-04 12:50:58,970 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:50:58,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:50:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:58,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:50:58,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:50:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:50:59,233 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:50:59,813 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:50:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1260 proven. 1890 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 12:50:59,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:50:59,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:50:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:50:59,912 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:50:59,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:50:59,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 1260 proven. 1890 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 12:51:00,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:00,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 12:51:00,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:51:00,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:51:00,126 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:00,126 INFO L87 Difference]: Start difference. First operand 146 states and 158 transitions. Second operand 38 states. [2018-10-04 12:51:00,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:00,574 INFO L93 Difference]: Finished difference Result 189 states and 214 transitions. [2018-10-04 12:51:00,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:51:00,575 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 145 [2018-10-04 12:51:00,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:00,576 INFO L225 Difference]: With dead ends: 189 [2018-10-04 12:51:00,576 INFO L226 Difference]: Without dead ends: 149 [2018-10-04 12:51:00,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 8 [2018-10-04 12:51:00,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-04 12:51:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-10-04 12:51:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-04 12:51:00,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2018-10-04 12:51:00,583 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 145 [2018-10-04 12:51:00,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:00,583 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2018-10-04 12:51:00,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:51:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2018-10-04 12:51:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-04 12:51:00,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:00,585 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 36, 12, 1, 1, 1] [2018-10-04 12:51:00,585 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:00,585 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash 593356871, now seen corresponding path program 35 times [2018-10-04 12:51:00,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:00,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:00,921 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:01,347 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 1295 proven. 1998 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 12:51:01,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:01,429 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:01,437 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:51:01,507 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-10-04 12:51:01,507 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:01,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 1295 proven. 1998 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 12:51:01,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:01,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 12:51:01,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 12:51:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 12:51:01,740 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:01,740 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand 39 states. [2018-10-04 12:51:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:02,064 INFO L93 Difference]: Finished difference Result 192 states and 217 transitions. [2018-10-04 12:51:02,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:51:02,065 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 148 [2018-10-04 12:51:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:02,065 INFO L225 Difference]: With dead ends: 192 [2018-10-04 12:51:02,065 INFO L226 Difference]: Without dead ends: 152 [2018-10-04 12:51:02,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.6s impTime 9 [2018-10-04 12:51:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-04 12:51:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-10-04 12:51:02,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-04 12:51:02,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2018-10-04 12:51:02,073 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 148 [2018-10-04 12:51:02,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:02,073 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2018-10-04 12:51:02,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 12:51:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2018-10-04 12:51:02,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-04 12:51:02,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:02,074 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 37, 12, 1, 1, 1] [2018-10-04 12:51:02,075 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:02,075 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:02,075 INFO L82 PathProgramCache]: Analyzing trace with hash -16981380, now seen corresponding path program 36 times [2018-10-04 12:51:02,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:02,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:02,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:02,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:03,080 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:03,505 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1330 proven. 2109 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2018-10-04 12:51:03,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:03,622 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:03,630 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:51:03,688 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-10-04 12:51:03,688 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:03,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:04,046 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:04,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 1406 proven. 222 refuted. 0 times theorem prover too weak. 1998 trivial. 0 not checked. [2018-10-04 12:51:04,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:04,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 15] total 53 [2018-10-04 12:51:04,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:51:04,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:51:04,100 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:04,100 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand 53 states. [2018-10-04 12:51:04,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:04,486 INFO L93 Difference]: Finished difference Result 199 states and 227 transitions. [2018-10-04 12:51:04,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:51:04,486 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 151 [2018-10-04 12:51:04,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:04,488 INFO L225 Difference]: With dead ends: 199 [2018-10-04 12:51:04,488 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 12:51:04,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time 1.3s impTime 8 [2018-10-04 12:51:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 12:51:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-10-04 12:51:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-04 12:51:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-10-04 12:51:04,496 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 151 [2018-10-04 12:51:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:04,497 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-10-04 12:51:04,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:51:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-10-04 12:51:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-04 12:51:04,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:04,498 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 38, 13, 1, 1, 1] [2018-10-04 12:51:04,498 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:04,498 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:04,498 INFO L82 PathProgramCache]: Analyzing trace with hash 758997082, now seen corresponding path program 37 times [2018-10-04 12:51:04,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:04,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:04,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:04,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:05,580 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:06,000 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1482 proven. 2223 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 12:51:06,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:06,153 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:06,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:06,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:06,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 1482 proven. 2223 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 12:51:06,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:06,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 12:51:06,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 12:51:06,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 12:51:06,427 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:06,427 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 41 states. [2018-10-04 12:51:06,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:06,660 INFO L93 Difference]: Finished difference Result 204 states and 231 transitions. [2018-10-04 12:51:06,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:51:06,660 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 157 [2018-10-04 12:51:06,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:06,662 INFO L225 Difference]: With dead ends: 204 [2018-10-04 12:51:06,662 INFO L226 Difference]: Without dead ends: 161 [2018-10-04 12:51:06,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.2s impTime 11 [2018-10-04 12:51:06,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-04 12:51:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-10-04 12:51:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-04 12:51:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2018-10-04 12:51:06,668 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 157 [2018-10-04 12:51:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:06,669 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2018-10-04 12:51:06,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 12:51:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2018-10-04 12:51:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-04 12:51:06,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:06,670 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 39, 13, 1, 1, 1] [2018-10-04 12:51:06,670 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:06,670 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash -821292603, now seen corresponding path program 38 times [2018-10-04 12:51:06,671 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:06,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:06,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:06,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:06,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:07,254 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:07,929 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 1520 proven. 2340 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 12:51:07,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:07,994 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:08,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:51:08,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:51:08,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:08,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 1520 proven. 2340 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 12:51:08,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:08,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 12:51:08,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:51:08,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:51:08,307 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:08,307 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand 42 states. [2018-10-04 12:51:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:08,441 INFO L93 Difference]: Finished difference Result 207 states and 234 transitions. [2018-10-04 12:51:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:51:08,442 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2018-10-04 12:51:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:08,443 INFO L225 Difference]: With dead ends: 207 [2018-10-04 12:51:08,444 INFO L226 Difference]: Without dead ends: 164 [2018-10-04 12:51:08,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.7s impTime 12 [2018-10-04 12:51:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-04 12:51:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-04 12:51:08,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-04 12:51:08,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2018-10-04 12:51:08,451 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 160 [2018-10-04 12:51:08,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:08,451 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2018-10-04 12:51:08,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:51:08,451 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2018-10-04 12:51:08,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-04 12:51:08,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:08,452 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 40, 13, 1, 1, 1] [2018-10-04 12:51:08,452 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:08,453 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash -2094766982, now seen corresponding path program 39 times [2018-10-04 12:51:08,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:08,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:08,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:08,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:08,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:09,212 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:09,580 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:09,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1558 proven. 2460 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2018-10-04 12:51:09,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:09,807 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:09,814 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:51:09,842 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-04 12:51:09,842 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:09,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:11,105 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:11,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 1640 proven. 260 refuted. 0 times theorem prover too weak. 2340 trivial. 0 not checked. [2018-10-04 12:51:11,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:11,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 16] total 57 [2018-10-04 12:51:11,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-04 12:51:11,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-04 12:51:11,193 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:11,193 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand 57 states. [2018-10-04 12:51:11,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:11,644 INFO L93 Difference]: Finished difference Result 214 states and 244 transitions. [2018-10-04 12:51:11,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:51:11,645 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 163 [2018-10-04 12:51:11,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:11,646 INFO L225 Difference]: With dead ends: 214 [2018-10-04 12:51:11,646 INFO L226 Difference]: Without dead ends: 171 [2018-10-04 12:51:11,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 1.9s impTime 12 [2018-10-04 12:51:11,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-04 12:51:11,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-10-04 12:51:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-04 12:51:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 184 transitions. [2018-10-04 12:51:11,653 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 184 transitions. Word has length 163 [2018-10-04 12:51:11,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:11,654 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 184 transitions. [2018-10-04 12:51:11,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-04 12:51:11,654 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 184 transitions. [2018-10-04 12:51:11,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-04 12:51:11,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:11,655 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 41, 14, 1, 1, 1] [2018-10-04 12:51:11,655 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:11,655 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1878872548, now seen corresponding path program 40 times [2018-10-04 12:51:11,656 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:11,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:11,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:12,175 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:12,748 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1722 proven. 2583 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 12:51:13,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:13,039 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:13,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:51:13,084 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:51:13,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:13,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:14,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 1722 proven. 2583 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 12:51:14,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:14,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 12:51:14,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:51:14,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:51:14,754 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:14,754 INFO L87 Difference]: Start difference. First operand 170 states and 184 transitions. Second operand 44 states. [2018-10-04 12:51:14,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:14,936 INFO L93 Difference]: Finished difference Result 219 states and 248 transitions. [2018-10-04 12:51:14,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:51:14,936 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 169 [2018-10-04 12:51:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:14,938 INFO L225 Difference]: With dead ends: 219 [2018-10-04 12:51:14,938 INFO L226 Difference]: Without dead ends: 173 [2018-10-04 12:51:14,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time 1.1s impTime 14 [2018-10-04 12:51:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-04 12:51:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-10-04 12:51:14,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-04 12:51:14,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2018-10-04 12:51:14,945 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 169 [2018-10-04 12:51:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:14,945 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2018-10-04 12:51:14,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:51:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2018-10-04 12:51:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-04 12:51:14,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:14,946 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 42, 14, 1, 1, 1] [2018-10-04 12:51:14,946 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:14,947 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash 890476295, now seen corresponding path program 41 times [2018-10-04 12:51:14,947 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:14,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:14,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:14,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:15,263 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:15,686 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 1763 proven. 2709 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 12:51:15,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:15,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:51:16,092 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 57 check-sat command(s) [2018-10-04 12:51:16,092 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:16,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 1763 proven. 2709 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 12:51:16,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:16,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 12:51:16,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 12:51:16,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 12:51:16,350 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:16,350 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand 45 states. [2018-10-04 12:51:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:16,537 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2018-10-04 12:51:16,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:51:16,537 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-04 12:51:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:16,539 INFO L225 Difference]: With dead ends: 222 [2018-10-04 12:51:16,539 INFO L226 Difference]: Without dead ends: 176 [2018-10-04 12:51:16,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 15 [2018-10-04 12:51:16,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-04 12:51:16,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-04 12:51:16,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-04 12:51:16,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 190 transitions. [2018-10-04 12:51:16,546 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 190 transitions. Word has length 172 [2018-10-04 12:51:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:16,546 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 190 transitions. [2018-10-04 12:51:16,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 12:51:16,546 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2018-10-04 12:51:16,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-04 12:51:16,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:16,547 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 43, 14, 1, 1, 1] [2018-10-04 12:51:16,547 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:16,547 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:16,547 INFO L82 PathProgramCache]: Analyzing trace with hash 535069244, now seen corresponding path program 42 times [2018-10-04 12:51:16,548 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:16,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:16,548 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:16,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:16,835 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:17,287 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1804 proven. 2838 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-04 12:51:17,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:17,381 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:17,389 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:51:17,464 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2018-10-04 12:51:17,464 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:17,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:17,682 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 1892 proven. 301 refuted. 0 times theorem prover too weak. 2709 trivial. 0 not checked. [2018-10-04 12:51:17,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 17] total 61 [2018-10-04 12:51:17,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-04 12:51:17,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-04 12:51:17,808 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:17,808 INFO L87 Difference]: Start difference. First operand 176 states and 190 transitions. Second operand 61 states. [2018-10-04 12:51:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:18,125 INFO L93 Difference]: Finished difference Result 229 states and 261 transitions. [2018-10-04 12:51:18,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:51:18,125 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 175 [2018-10-04 12:51:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:18,127 INFO L225 Difference]: With dead ends: 229 [2018-10-04 12:51:18,127 INFO L226 Difference]: Without dead ends: 183 [2018-10-04 12:51:18,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.8s impTime 16 [2018-10-04 12:51:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-04 12:51:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-10-04 12:51:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 12:51:18,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 197 transitions. [2018-10-04 12:51:18,133 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 197 transitions. Word has length 175 [2018-10-04 12:51:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:18,133 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 197 transitions. [2018-10-04 12:51:18,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-04 12:51:18,133 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 197 transitions. [2018-10-04 12:51:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-04 12:51:18,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:18,134 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 44, 15, 1, 1, 1] [2018-10-04 12:51:18,134 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:18,134 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1003346330, now seen corresponding path program 43 times [2018-10-04 12:51:18,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:18,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:18,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:18,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:20,359 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:20,758 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 1980 proven. 2970 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 12:51:21,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:21,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:21,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:21,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 1980 proven. 2970 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 12:51:21,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:21,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 12:51:21,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 12:51:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 12:51:21,458 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:21,458 INFO L87 Difference]: Start difference. First operand 182 states and 197 transitions. Second operand 47 states. [2018-10-04 12:51:21,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:21,651 INFO L93 Difference]: Finished difference Result 234 states and 265 transitions. [2018-10-04 12:51:21,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:51:21,652 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 181 [2018-10-04 12:51:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:21,653 INFO L225 Difference]: With dead ends: 234 [2018-10-04 12:51:21,653 INFO L226 Difference]: Without dead ends: 185 [2018-10-04 12:51:21,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time 2.4s impTime 17 [2018-10-04 12:51:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-04 12:51:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-10-04 12:51:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-04 12:51:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 200 transitions. [2018-10-04 12:51:21,658 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 200 transitions. Word has length 181 [2018-10-04 12:51:21,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:21,658 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 200 transitions. [2018-10-04 12:51:21,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 12:51:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 200 transitions. [2018-10-04 12:51:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-04 12:51:21,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:21,660 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 45, 15, 1, 1, 1] [2018-10-04 12:51:21,660 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:21,660 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2030680581, now seen corresponding path program 44 times [2018-10-04 12:51:21,660 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:21,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:21,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:21,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:21,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:22,062 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:22,255 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2024 proven. 3105 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 12:51:22,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:22,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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:22,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:51:22,801 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:51:22,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:22,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 2024 proven. 3105 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 12:51:23,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:23,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 12:51:23,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:51:23,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:51:23,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:23,093 INFO L87 Difference]: Start difference. First operand 185 states and 200 transitions. Second operand 48 states. [2018-10-04 12:51:23,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:23,310 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2018-10-04 12:51:23,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:51:23,311 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 184 [2018-10-04 12:51:23,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:23,312 INFO L225 Difference]: With dead ends: 237 [2018-10-04 12:51:23,312 INFO L226 Difference]: Without dead ends: 188 [2018-10-04 12:51:23,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 18 [2018-10-04 12:51:23,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-04 12:51:23,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-04 12:51:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-04 12:51:23,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 203 transitions. [2018-10-04 12:51:23,318 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 203 transitions. Word has length 184 [2018-10-04 12:51:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:23,319 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 203 transitions. [2018-10-04 12:51:23,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:51:23,319 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 203 transitions. [2018-10-04 12:51:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-04 12:51:23,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:23,320 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 46, 15, 1, 1, 1] [2018-10-04 12:51:23,320 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:23,320 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:23,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1408400826, now seen corresponding path program 45 times [2018-10-04 12:51:23,320 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:23,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:23,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:23,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:23,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:23,714 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:23,936 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2068 proven. 3243 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2018-10-04 12:51:24,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:24,254 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:24,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:51:24,303 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-04 12:51:24,303 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:24,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:24,500 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 2162 proven. 345 refuted. 0 times theorem prover too weak. 3105 trivial. 0 not checked. [2018-10-04 12:51:24,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:24,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 18] total 65 [2018-10-04 12:51:24,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-04 12:51:24,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-04 12:51:24,827 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:24,827 INFO L87 Difference]: Start difference. First operand 188 states and 203 transitions. Second operand 65 states. [2018-10-04 12:51:25,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:25,214 INFO L93 Difference]: Finished difference Result 244 states and 278 transitions. [2018-10-04 12:51:25,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-04 12:51:25,215 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 187 [2018-10-04 12:51:25,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:25,216 INFO L225 Difference]: With dead ends: 244 [2018-10-04 12:51:25,216 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 12:51:25,217 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 20 [2018-10-04 12:51:25,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 12:51:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-10-04 12:51:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-04 12:51:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 210 transitions. [2018-10-04 12:51:25,223 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 210 transitions. Word has length 187 [2018-10-04 12:51:25,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:25,223 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 210 transitions. [2018-10-04 12:51:25,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-04 12:51:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 210 transitions. [2018-10-04 12:51:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-04 12:51:25,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:25,225 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 47, 16, 1, 1, 1] [2018-10-04 12:51:25,225 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:25,225 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash -622412324, now seen corresponding path program 46 times [2018-10-04 12:51:25,225 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:25,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:25,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:26,031 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:26,464 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2256 proven. 3384 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 12:51:26,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:26,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:26,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:51:27,020 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:51:27,021 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:27,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:27,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 2256 proven. 3384 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 12:51:27,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:27,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-04 12:51:27,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:51:27,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:51:27,391 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:27,391 INFO L87 Difference]: Start difference. First operand 194 states and 210 transitions. Second operand 50 states. [2018-10-04 12:51:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:28,710 INFO L93 Difference]: Finished difference Result 249 states and 282 transitions. [2018-10-04 12:51:28,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:51:28,711 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-10-04 12:51:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:28,712 INFO L225 Difference]: With dead ends: 249 [2018-10-04 12:51:28,712 INFO L226 Difference]: Without dead ends: 197 [2018-10-04 12:51:28,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.3s impTime 20 [2018-10-04 12:51:28,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-04 12:51:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-10-04 12:51:28,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-04 12:51:28,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2018-10-04 12:51:28,717 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 193 [2018-10-04 12:51:28,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:28,718 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2018-10-04 12:51:28,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:51:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2018-10-04 12:51:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-04 12:51:28,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:28,719 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 48, 16, 1, 1, 1] [2018-10-04 12:51:28,719 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:28,719 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:28,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1846957511, now seen corresponding path program 47 times [2018-10-04 12:51:28,719 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:28,719 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:28,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:28,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:29,288 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:29,686 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2303 proven. 3528 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 12:51:30,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:30,010 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:30,017 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:51:30,117 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2018-10-04 12:51:30,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:30,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:30,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 2303 proven. 3528 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 12:51:30,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:30,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-04 12:51:30,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-04 12:51:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-04 12:51:30,409 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:30,409 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand 51 states. [2018-10-04 12:51:30,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:30,620 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2018-10-04 12:51:30,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:51:30,620 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 196 [2018-10-04 12:51:30,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:30,621 INFO L225 Difference]: With dead ends: 252 [2018-10-04 12:51:30,621 INFO L226 Difference]: Without dead ends: 200 [2018-10-04 12:51:30,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 0.9s impTime 21 [2018-10-04 12:51:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-04 12:51:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-10-04 12:51:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-04 12:51:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 216 transitions. [2018-10-04 12:51:30,629 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 216 transitions. Word has length 196 [2018-10-04 12:51:30,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:30,629 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 216 transitions. [2018-10-04 12:51:30,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-04 12:51:30,629 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 216 transitions. [2018-10-04 12:51:30,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-04 12:51:30,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:30,630 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 49, 16, 1, 1, 1] [2018-10-04 12:51:30,631 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:30,631 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1651101188, now seen corresponding path program 48 times [2018-10-04 12:51:30,631 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:30,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:30,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:31,063 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:31,468 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:32,076 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:32,105 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2350 proven. 3675 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2018-10-04 12:51:32,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:32,106 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:32,114 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:51:32,192 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2018-10-04 12:51:32,192 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:32,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 2450 proven. 392 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2018-10-04 12:51:32,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:32,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 19] total 69 [2018-10-04 12:51:32,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-04 12:51:32,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-04 12:51:32,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:32,517 INFO L87 Difference]: Start difference. First operand 200 states and 216 transitions. Second operand 69 states. [2018-10-04 12:51:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:33,013 INFO L93 Difference]: Finished difference Result 259 states and 295 transitions. [2018-10-04 12:51:33,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-04 12:51:33,014 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 199 [2018-10-04 12:51:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:33,015 INFO L225 Difference]: With dead ends: 259 [2018-10-04 12:51:33,015 INFO L226 Difference]: Without dead ends: 207 [2018-10-04 12:51:33,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 1.3s impTime 24 [2018-10-04 12:51:33,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-04 12:51:33,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-10-04 12:51:33,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-04 12:51:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-10-04 12:51:33,022 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 199 [2018-10-04 12:51:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:33,022 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-10-04 12:51:33,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-04 12:51:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-10-04 12:51:33,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-04 12:51:33,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:33,023 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 50, 17, 1, 1, 1] [2018-10-04 12:51:33,023 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:33,023 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1403567398, now seen corresponding path program 49 times [2018-10-04 12:51:33,024 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:33,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:33,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:33,338 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:33,377 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 2832 proven. 551 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 12:51:33,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:33,377 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:33,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:33,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:33,623 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:33,807 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:34,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:34,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 69] total 72 [2018-10-04 12:51:34,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:51:34,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:51:34,150 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:34,150 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 72 states. [2018-10-04 12:51:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:34,554 INFO L93 Difference]: Finished difference Result 218 states and 241 transitions. [2018-10-04 12:51:34,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 12:51:34,554 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 205 [2018-10-04 12:51:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:34,556 INFO L225 Difference]: With dead ends: 218 [2018-10-04 12:51:34,556 INFO L226 Difference]: Without dead ends: 216 [2018-10-04 12:51:34,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.4s impTime 24 [2018-10-04 12:51:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-04 12:51:34,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-10-04 12:51:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-04 12:51:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 235 transitions. [2018-10-04 12:51:34,564 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 235 transitions. Word has length 205 [2018-10-04 12:51:34,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:34,564 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 235 transitions. [2018-10-04 12:51:34,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:51:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 235 transitions. [2018-10-04 12:51:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-04 12:51:34,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:34,566 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 50, 20, 1, 1, 1] [2018-10-04 12:51:34,566 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:34,566 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash 29832167, now seen corresponding path program 50 times [2018-10-04 12:51:34,567 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:34,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:51:34,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:34,844 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 3264 proven. 737 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 12:51:34,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:34,944 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:34,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:51:35,006 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:51:35,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:35,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:35,195 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:36,623 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:37,956 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:37,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:37,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 72] total 75 [2018-10-04 12:51:37,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-04 12:51:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-04 12:51:37,978 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:37,978 INFO L87 Difference]: Start difference. First operand 215 states and 235 transitions. Second operand 75 states. [2018-10-04 12:51:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:38,499 INFO L93 Difference]: Finished difference Result 227 states and 253 transitions. [2018-10-04 12:51:38,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-04 12:51:38,500 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 214 [2018-10-04 12:51:38,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:38,502 INFO L225 Difference]: With dead ends: 227 [2018-10-04 12:51:38,502 INFO L226 Difference]: Without dead ends: 225 [2018-10-04 12:51:38,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s Time 1.5s impTime 24 [2018-10-04 12:51:38,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-04 12:51:38,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-10-04 12:51:38,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-04 12:51:38,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 247 transitions. [2018-10-04 12:51:38,511 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 247 transitions. Word has length 214 [2018-10-04 12:51:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:38,512 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 247 transitions. [2018-10-04 12:51:38,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-04 12:51:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 247 transitions. [2018-10-04 12:51:38,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-04 12:51:38,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:38,513 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 50, 23, 1, 1, 1] [2018-10-04 12:51:38,513 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:38,514 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:38,514 INFO L82 PathProgramCache]: Analyzing trace with hash -462347910, now seen corresponding path program 51 times [2018-10-04 12:51:38,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:38,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:38,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:38,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:38,717 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3696 proven. 950 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 12:51:38,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:38,870 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:38,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:51:38,947 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-04 12:51:38,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:38,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:39,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 3550 proven. 805 refuted. 0 times theorem prover too weak. 3675 trivial. 0 not checked. [2018-10-04 12:51:39,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:39,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 28 [2018-10-04 12:51:39,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:51:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:51:39,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:39,209 INFO L87 Difference]: Start difference. First operand 224 states and 247 transitions. Second operand 28 states. [2018-10-04 12:51:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:39,335 INFO L93 Difference]: Finished difference Result 236 states and 265 transitions. [2018-10-04 12:51:39,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:51:39,335 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 223 [2018-10-04 12:51:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:39,337 INFO L225 Difference]: With dead ends: 236 [2018-10-04 12:51:39,337 INFO L226 Difference]: Without dead ends: 234 [2018-10-04 12:51:39,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 13 [2018-10-04 12:51:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-04 12:51:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-04 12:51:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-04 12:51:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 259 transitions. [2018-10-04 12:51:39,345 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 259 transitions. Word has length 223 [2018-10-04 12:51:39,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:39,345 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 259 transitions. [2018-10-04 12:51:39,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:51:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 259 transitions. [2018-10-04 12:51:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-04 12:51:39,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:39,346 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 50, 26, 1, 1, 1] [2018-10-04 12:51:39,346 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:39,346 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:39,347 INFO L82 PathProgramCache]: Analyzing trace with hash 869124423, now seen corresponding path program 52 times [2018-10-04 12:51:39,347 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:39,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:39,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:39,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:39,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:39,605 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 4128 proven. 1190 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 12:51:39,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:39,852 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:39,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:51:39,916 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:51:39,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:39,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:40,093 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:40,296 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:51:40,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:40,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 78] total 81 [2018-10-04 12:51:40,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-04 12:51:40,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-04 12:51:40,656 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:40,656 INFO L87 Difference]: Start difference. First operand 233 states and 259 transitions. Second operand 81 states. [2018-10-04 12:51:41,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:41,173 INFO L93 Difference]: Finished difference Result 245 states and 277 transitions. [2018-10-04 12:51:41,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-04 12:51:41,174 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 232 [2018-10-04 12:51:41,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:41,175 INFO L225 Difference]: With dead ends: 245 [2018-10-04 12:51:41,175 INFO L226 Difference]: Without dead ends: 243 [2018-10-04 12:51:41,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.6s impTime 23 [2018-10-04 12:51:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-04 12:51:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2018-10-04 12:51:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-04 12:51:41,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 271 transitions. [2018-10-04 12:51:41,181 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 271 transitions. Word has length 232 [2018-10-04 12:51:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:41,182 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 271 transitions. [2018-10-04 12:51:41,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-04 12:51:41,182 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 271 transitions. [2018-10-04 12:51:41,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-04 12:51:41,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:41,183 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 50, 29, 1, 1, 1] [2018-10-04 12:51:41,183 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:41,183 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:41,183 INFO L82 PathProgramCache]: Analyzing trace with hash -208889830, now seen corresponding path program 53 times [2018-10-04 12:51:41,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:41,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:41,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:41,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:41,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:42,094 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 4560 proven. 1457 refuted. 0 times theorem prover too weak. 3384 trivial. 0 not checked. [2018-10-04 12:51:42,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:42,260 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:42,268 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:51:42,653 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 80 check-sat command(s) [2018-10-04 12:51:42,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:42,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:43,109 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:43,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 4470 proven. 3626 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-10-04 12:51:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 52] total 52 [2018-10-04 12:51:43,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:51:43,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:51:43,414 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:43,414 INFO L87 Difference]: Start difference. First operand 242 states and 271 transitions. Second operand 52 states. [2018-10-04 12:51:43,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:43,788 INFO L93 Difference]: Finished difference Result 307 states and 377 transitions. [2018-10-04 12:51:43,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:51:43,789 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 241 [2018-10-04 12:51:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:43,791 INFO L225 Difference]: With dead ends: 307 [2018-10-04 12:51:43,791 INFO L226 Difference]: Without dead ends: 305 [2018-10-04 12:51:43,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time 0.9s impTime 21 [2018-10-04 12:51:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-04 12:51:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-10-04 12:51:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-04 12:51:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 355 transitions. [2018-10-04 12:51:43,800 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 355 transitions. Word has length 241 [2018-10-04 12:51:43,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:43,800 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 355 transitions. [2018-10-04 12:51:43,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:51:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 355 transitions. [2018-10-04 12:51:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-04 12:51:43,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:43,802 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 50, 50, 1, 1, 1] [2018-10-04 12:51:43,802 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:43,802 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash 602025671, now seen corresponding path program 54 times [2018-10-04 12:51:43,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:43,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:43,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:43,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:43,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:44,626 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 19 [2018-10-04 12:51:45,198 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 35 new depth: 35 [2018-10-04 12:51:46,131 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 50 new depth: 50 [2018-10-04 12:51:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-10-04 12:51:46,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:51:46,337 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:51:46,345 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:51:46,567 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 101 check-sat command(s) [2018-10-04 12:51:46,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:51:46,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:51:47,932 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 11225 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-10-04 12:51:47,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:51:47,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 12:51:47,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 12:51:47,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 12:51:47,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:47,955 INFO L87 Difference]: Start difference. First operand 305 states and 355 transitions. Second operand 53 states. [2018-10-04 12:51:50,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:50,162 INFO L93 Difference]: Finished difference Result 4284 states and 5659 transitions. [2018-10-04 12:51:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:51:50,162 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 304 [2018-10-04 12:51:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:50,179 INFO L225 Difference]: With dead ends: 4284 [2018-10-04 12:51:50,180 INFO L226 Difference]: Without dead ends: 4282 [2018-10-04 12:51:50,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s Time 1.7s impTime 51 [2018-10-04 12:51:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-04 12:51:50,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 308. [2018-10-04 12:51:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-04 12:51:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 359 transitions. [2018-10-04 12:51:50,373 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 359 transitions. Word has length 304 [2018-10-04 12:51:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:50,374 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 359 transitions. [2018-10-04 12:51:50,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 12:51:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 359 transitions. [2018-10-04 12:51:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-04 12:51:50,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:51:50,376 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 51, 50, 1, 1, 1] [2018-10-04 12:51:50,376 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:51:50,376 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 12:51:50,377 INFO L82 PathProgramCache]: Analyzing trace with hash -834605638, now seen corresponding path program 55 times [2018-10-04 12:51:50,377 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:51:50,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:51:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:50,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:51:50,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:51:50,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:51:51,273 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 19 new depth: 6 [2018-10-04 12:51:51,447 INFO L252 BPredicateUnifier]: --------PredicateTrie is restructured: old depths: 22 new depth: 7 [2018-10-04 12:51:51,668 INFO L134 CoverageAnalysis]: Checked inductivity of 15352 backedges. 11527 proven. 0 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2018-10-04 12:51:51,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:51:51,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-04 12:51:51,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:51:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:51:51,669 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 12:51:51,669 INFO L87 Difference]: Start difference. First operand 308 states and 359 transitions. Second operand 52 states. [2018-10-04 12:51:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:51:52,135 INFO L93 Difference]: Finished difference Result 457 states and 557 transitions. [2018-10-04 12:51:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:51:52,136 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 307 [2018-10-04 12:51:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:51:52,136 INFO L225 Difference]: With dead ends: 457 [2018-10-04 12:51:52,137 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:51:52,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 20 [2018-10-04 12:51:52,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:51:52,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:51:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:51:52,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:51:52,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-10-04 12:51:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:51:52,138 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:51:52,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:51:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:51:52,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:51:52,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:51:53,359 WARN L178 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 1835 DAG size of output: 410 [2018-10-04 12:51:54,074 WARN L178 SmtUtils]: Spent 710.00 ms on a formula simplification. DAG size of input: 1830 DAG size of output: 400 [2018-10-04 12:51:54,693 WARN L178 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 1835 DAG size of output: 410 [2018-10-04 12:51:56,751 WARN L178 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 410 DAG size of output: 357 [2018-10-04 12:51:59,125 WARN L178 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-10-04 12:52:00,978 WARN L178 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 410 DAG size of output: 357 [2018-10-04 12:52:00,981 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-10-04 12:52:00,981 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2018-10-04 12:52:00,982 INFO L421 ceAbstractionStarter]: At program point L32(lines 29 38) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-04 12:52:00,982 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 43) no Hoare annotation was computed. [2018-10-04 12:52:00,982 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-10-04 12:52:00,983 INFO L421 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-10-04 12:52:00,983 INFO L421 ceAbstractionStarter]: At program point L16(lines 16 27) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-04 12:52:00,984 INFO L421 ceAbstractionStarter]: At program point L42(lines 13 42) the Hoare annotation is: (or (and (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96)) (<= 96 ULTIMATE.start_main_~x~4)) (and (<= 79 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79))) (and (and (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (<= 97 ULTIMATE.start_main_~x~4)) (and (and (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (<= 95 ULTIMATE.start_main_~x~4)) (and (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91)) (<= 91 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (<= 72 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62)) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= 54 ULTIMATE.start_main_~x~4) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54))) (and (<= 60 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 60) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4))) (and (<= 98 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 98) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4))) (and (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= ULTIMATE.start_main_~x~4 88)) (<= 88 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 73)) (<= 73 ULTIMATE.start_main_~x~4)) (and (<= 61 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61))) (and (<= 64 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64))) (and (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76)) (<= 76 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4)) (<= 84 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 85)) (<= 85 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4)) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= 69 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 69) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4))) (and (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= ULTIMATE.start_main_~x~4 55)) (<= 55 ULTIMATE.start_main_~x~4)) (and (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= ULTIMATE.start_main_~x~4 99)) (<= 99 ULTIMATE.start_main_~x~4)) (and (<= 53 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4))) (and (<= 77 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 77) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4))) (and (<= 89 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~y~4))) (and (<= 94 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93)) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= 68 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 68) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~y~4)) (<= 81 ULTIMATE.start_main_~x~4)) (and (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= ULTIMATE.start_main_~x~4 57)) (<= 57 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (<= 82 ULTIMATE.start_main_~x~4)) (and (<= 78 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 78))) (and (and (<= ULTIMATE.start_main_~y~4 65) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (<= 65 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 90)) (<= 90 ULTIMATE.start_main_~x~4)) (and (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4)) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (and (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63))) (and (<= 51 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51))) (and (<= 52 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52))) (and (<= 86 ULTIMATE.start_main_~x~4) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= ULTIMATE.start_main_~x~4 86))) (and (and (<= 74 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (<= 74 ULTIMATE.start_main_~x~4)) (and (<= 56 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4))) (and (<= 67 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67))) (and (<= 83 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83))) (and (<= 58 ULTIMATE.start_main_~x~4) (and (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4))) (and (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87)) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~x~4) (and (<= 66 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66))) (and (<= 70 ULTIMATE.start_main_~x~4) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= ULTIMATE.start_main_~y~4 70))) (and (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80)) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~x~4) (and (<= 71 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71))) (and (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~y~4)) (<= 75 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 50) (<= ULTIMATE.start_main_~y~4 50) (<= 50 ULTIMATE.start_main_~y~4)) (and (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 92)) (<= 92 ULTIMATE.start_main_~x~4))) [2018-10-04 12:52:01,026 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:52:01 BoogieIcfgContainer [2018-10-04 12:52:01,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:52:01,027 INFO L168 Benchmark]: Toolchain (without parser) took 91381.53 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 610.3 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 130.1 MB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2018-10-04 12:52:01,028 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:01,030 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.74 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:01,031 INFO L168 Benchmark]: Boogie Preprocessor took 18.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:52:01,031 INFO L168 Benchmark]: RCFGBuilder took 325.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:52:01,032 INFO L168 Benchmark]: TraceAbstraction took 90998.30 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 610.3 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 109.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-04 12:52:01,035 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.18 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 33.74 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 18.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 325.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90998.30 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 610.3 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 109.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4) || (79 <= main_~x~4 && (main_~y~4 <= 79 && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 97 && main_~x~4 <= 97) && 97 <= main_~y~4) && 97 <= main_~x~4)) || (((95 <= main_~y~4 && main_~y~4 <= 95) && main_~x~4 <= 95) && 95 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((main_~x~4 <= 72 && 72 <= main_~y~4) && main_~y~4 <= 72) && 72 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (54 <= main_~x~4 && (54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54)) || (60 <= main_~x~4 && (main_~y~4 <= 60 && main_~x~4 <= 60) && 60 <= main_~y~4)) || (98 <= main_~x~4 && (main_~x~4 <= 98 && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && main_~x~4 <= 88) && 88 <= main_~x~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && main_~y~4 <= 73) && 73 <= main_~x~4)) || (61 <= main_~x~4 && (main_~x~4 <= 61 && 61 <= main_~y~4) && main_~y~4 <= 61)) || (64 <= main_~x~4 && (main_~x~4 <= 64 && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && main_~x~4 <= 85) && 85 <= main_~x~4)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (69 <= main_~x~4 && (main_~y~4 <= 69 && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && main_~x~4 <= 55) && 55 <= main_~x~4)) || (((99 <= main_~y~4 && main_~y~4 <= 99) && main_~x~4 <= 99) && 99 <= main_~x~4)) || (53 <= main_~x~4 && (main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4)) || (77 <= main_~x~4 && (main_~x~4 <= 77 && main_~y~4 <= 77) && 77 <= main_~y~4)) || (89 <= main_~x~4 && (main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~y~4)) || (94 <= main_~x~4 && (main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (68 <= main_~x~4 && (main_~x~4 <= 68 && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~y~4) && 81 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && main_~x~4 <= 57) && 57 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (78 <= main_~x~4 && (main_~x~4 <= 78 && 78 <= main_~y~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 65 && main_~x~4 <= 65) && 65 <= main_~y~4) && 65 <= main_~x~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && main_~y~4 <= 90) && 90 <= main_~x~4)) || (63 <= main_~x~4 && (63 <= main_~y~4 && main_~y~4 <= 63) && main_~x~4 <= 63)) || (51 <= main_~x~4 && (main_~y~4 <= 51 && 51 <= main_~y~4) && main_~x~4 <= 51)) || (52 <= main_~x~4 && (main_~x~4 <= 52 && 52 <= main_~y~4) && main_~y~4 <= 52)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (56 <= main_~x~4 && (main_~y~4 <= 56 && main_~x~4 <= 56) && 56 <= main_~y~4)) || (67 <= main_~x~4 && (main_~y~4 <= 67 && 67 <= main_~y~4) && main_~x~4 <= 67)) || (83 <= main_~x~4 && (main_~y~4 <= 83 && 83 <= main_~y~4) && main_~x~4 <= 83)) || (58 <= main_~x~4 && (main_~y~4 <= 58 && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (71 <= main_~x~4 && (71 <= main_~y~4 && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~y~4) && 75 <= main_~x~4)) || ((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && main_~y~4 <= 92) && 92 <= main_~x~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 90.8s OverallTime, 57 OverallIterations, 102 TraceHistogramMax, 15.3s AutomataDifference, 0.0s DeadEndRemovalTime, 8.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 945 SDslu, 10370 SDs, 0 SdLazy, 8263 SolverSat, 1805 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8028 GetRequests, 6199 SyntacticMatches, 2 SemanticMatches, 1827 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=56, 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.5s AutomataMinimizationTime, 57 MinimizatonAttempts, 3995 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 306 NumberOfFragments, 2114 HoareAnnotationTreeSize, 4 FomulaSimplifications, 41233 FormulaSimplificationTreeSizeReduction, 2.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 610 FormulaSimplificationTreeSizeReductionInter, 6.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 3.2s SatisfiabilityAnalysisTime, 59.6s InterpolantComputationTime, 13339 NumberOfCodeBlocks, 12541 NumberOfCodeBlocksAsserted, 964 NumberOfCheckSat, 13227 ConstructedInterpolants, 0 QuantifiedInterpolants, 5682843 SizeOfPredicates, 25 NumberOfNonLiveVariables, 11131 ConjunctsInSsa, 1456 ConjunctsInUnsatCore, 112 InterpolantComputations, 3 PerfectInterpolantSequences, 183380/343178 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-52-01-049.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-52-01-049.csv Received shutdown request...