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/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f-m [2018-10-04 14:24:11,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 14:24:11,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 14:24:11,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 14:24:11,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 14:24:11,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 14:24:11,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 14:24:11,579 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 14:24:11,581 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 14:24:11,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 14:24:11,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 14:24:11,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 14:24:11,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 14:24:11,585 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 14:24:11,586 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 14:24:11,587 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 14:24:11,588 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 14:24:11,589 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 14:24:11,592 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 14:24:11,593 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 14:24:11,594 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 14:24:11,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 14:24:11,598 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 14:24:11,598 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 14:24:11,599 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 14:24:11,600 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 14:24:11,601 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 14:24:11,602 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 14:24:11,602 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 14:24:11,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 14:24:11,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 14:24:11,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 14:24:11,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 14:24:11,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 14:24:11,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 14:24:11,607 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 14:24:11,607 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 14:24:11,624 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 14:24:11,624 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 14:24:11,625 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 14:24:11,625 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 14:24:11,626 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 14:24:11,626 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 14:24:11,626 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 14:24:11,626 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 14:24:11,627 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 14:24:11,627 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 14:24:11,627 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 14:24:11,627 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 14:24:11,627 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 14:24:11,627 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 14:24:11,628 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 14:24:11,628 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 14:24:11,628 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 14:24:11,628 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 14:24:11,629 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 14:24:11,629 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 14:24:11,629 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 14:24:11,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 14:24:11,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 14:24:11,630 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 14:24:11,630 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 14:24:11,630 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 14:24:11,630 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 14:24:11,630 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 14:24:11,630 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 14:24:11,631 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 14:24:11,631 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 14:24:11,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 14:24:11,697 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 14:24:11,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 14:24:11,705 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 14:24:11,706 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 14:24:11,707 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-10-04 14:24:11,707 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl' [2018-10-04 14:24:11,757 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 14:24:11,759 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 14:24:11,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:11,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 14:24:11,760 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 14:24:11,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,787 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 14:24:11,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 14:24:11,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 14:24:11,794 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 14:24:11,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/1) ... [2018-10-04 14:24:11,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 14:24:11,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 14:24:11,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 14:24:11,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 14:24:11,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (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 14:24:11,871 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-04 14:24:11,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 14:24:11,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 14:24:12,096 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 14:24:12,097 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:12 BoogieIcfgContainer [2018-10-04 14:24:12,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 14:24:12,098 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 14:24:12,098 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 14:24:12,102 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 14:24:12,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 02:24:11" (1/2) ... [2018-10-04 14:24:12,103 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bae161d and model type gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 02:24:12, skipping insertion in model container [2018-10-04 14:24:12,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 02:24:12" (2/2) ... [2018-10-04 14:24:12,105 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl [2018-10-04 14:24:12,116 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 14:24:12,127 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 14:24:12,183 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 14:24:12,183 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 14:24:12,184 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 14:24:12,184 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 14:24:12,184 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 14:24:12,184 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 14:24:12,184 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 14:24:12,184 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 14:24:12,184 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 14:24:12,197 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-04 14:24:12,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-04 14:24:12,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:12,205 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-04 14:24:12,206 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:12,212 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:12,212 INFO L82 PathProgramCache]: Analyzing trace with hash 30023, now seen corresponding path program 1 times [2018-10-04 14:24:12,214 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:12,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:12,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:12,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:12,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:12,360 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 14:24:12,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:24:12,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 14:24:12,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 14:24:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 14:24:12,383 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:12,386 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-04 14:24:12,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:12,456 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2018-10-04 14:24:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 14:24:12,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-10-04 14:24:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:12,474 INFO L225 Difference]: With dead ends: 13 [2018-10-04 14:24:12,475 INFO L226 Difference]: Without dead ends: 7 [2018-10-04 14:24:12,480 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 14:24:12,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-04 14:24:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-04 14:24:12,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-04 14:24:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-10-04 14:24:12,525 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 3 [2018-10-04 14:24:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:12,525 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-10-04 14:24:12,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 14:24:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-10-04 14:24:12,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 14:24:12,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:12,527 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 14:24:12,527 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:12,527 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:12,528 INFO L82 PathProgramCache]: Analyzing trace with hash 28788909, now seen corresponding path program 1 times [2018-10-04 14:24:12,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:12,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:12,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:12,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:12,641 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 14:24:12,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:12,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:12,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:12,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:12,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 14:24:12,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2018-10-04 14:24:12,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:24:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:24:12,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:12,865 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-10-04 14:24:13,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:13,016 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2018-10-04 14:24:13,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:24:13,017 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-10-04 14:24:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:13,018 INFO L225 Difference]: With dead ends: 15 [2018-10-04 14:24:13,018 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 14:24:13,019 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 3 [2018-10-04 14:24:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 14:24:13,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-10-04 14:24:13,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-04 14:24:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-10-04 14:24:13,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2018-10-04 14:24:13,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:13,025 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-10-04 14:24:13,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:24:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-10-04 14:24:13,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 14:24:13,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:13,026 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-10-04 14:24:13,027 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:13,027 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:13,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1253675643, now seen corresponding path program 1 times [2018-10-04 14:24:13,028 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:13,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:13,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:13,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:13,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:13,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:13,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:13,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:13,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:13,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:13,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 14:24:13,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 14:24:13,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 14:24:13,237 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:13,238 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 5 states. [2018-10-04 14:24:13,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:13,350 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-10-04 14:24:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 14:24:13,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-10-04 14:24:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:13,352 INFO L225 Difference]: With dead ends: 17 [2018-10-04 14:24:13,352 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 14:24:13,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 3 [2018-10-04 14:24:13,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 14:24:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 14:24:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 14:24:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-10-04 14:24:13,356 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 9 [2018-10-04 14:24:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:13,357 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-10-04 14:24:13,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 14:24:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-10-04 14:24:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 14:24:13,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:13,358 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-10-04 14:24:13,358 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:13,359 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash -2105425567, now seen corresponding path program 2 times [2018-10-04 14:24:13,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:13,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:13,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:13,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:13,568 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 14:24:13,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:13,632 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:13,632 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:13,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:13,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:13,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-04 14:24:13,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-04 14:24:13,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-04 14:24:13,727 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:13,727 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2018-10-04 14:24:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:13,846 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-10-04 14:24:13,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 14:24:13,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-10-04 14:24:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:13,847 INFO L225 Difference]: With dead ends: 19 [2018-10-04 14:24:13,848 INFO L226 Difference]: Without dead ends: 14 [2018-10-04 14:24:13,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 4 [2018-10-04 14:24:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-04 14:24:13,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-04 14:24:13,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-04 14:24:13,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-10-04 14:24:13,852 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-10-04 14:24:13,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:13,853 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-10-04 14:24:13,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-04 14:24:13,853 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-10-04 14:24:13,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-04 14:24:13,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:13,854 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1] [2018-10-04 14:24:13,854 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:13,855 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash -386281785, now seen corresponding path program 3 times [2018-10-04 14:24:13,855 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:13,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:13,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:13,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:13,956 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 14:24:13,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:13,982 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 14:24:13,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:13,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-04 14:24:14,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:14,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 9 [2018-10-04 14:24:14,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:24:14,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:24:14,149 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:14,149 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 9 states. [2018-10-04 14:24:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:14,240 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-10-04 14:24:14,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:24:14,240 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2018-10-04 14:24:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:14,243 INFO L225 Difference]: With dead ends: 24 [2018-10-04 14:24:14,243 INFO L226 Difference]: Without dead ends: 19 [2018-10-04 14:24:14,243 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.1s impTime 7 [2018-10-04 14:24:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-04 14:24:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-10-04 14:24:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-04 14:24:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-10-04 14:24:14,249 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2018-10-04 14:24:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:14,249 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-10-04 14:24:14,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:24:14,250 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-10-04 14:24:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-04 14:24:14,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:14,250 INFO L375 BasicCegarLoop]: trace histogram [7, 5, 2, 1, 1, 1] [2018-10-04 14:24:14,251 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:14,251 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1190710251, now seen corresponding path program 4 times [2018-10-04 14:24:14,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:14,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:14,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:14,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:24:14,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:14,345 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 14:24:14,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:14,376 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:14,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:14,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:24:14,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:14,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-04 14:24:14,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 14:24:14,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 14:24:14,470 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:14,470 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 8 states. [2018-10-04 14:24:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:14,758 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-10-04 14:24:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 14:24:14,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-10-04 14:24:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:14,759 INFO L225 Difference]: With dead ends: 27 [2018-10-04 14:24:14,759 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 14:24:14,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 6 [2018-10-04 14:24:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 14:24:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-04 14:24:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-04 14:24:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-10-04 14:24:14,764 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-10-04 14:24:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:14,765 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-10-04 14:24:14,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 14:24:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-10-04 14:24:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-04 14:24:14,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:14,766 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 2, 1, 1, 1] [2018-10-04 14:24:14,766 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:14,767 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:14,767 INFO L82 PathProgramCache]: Analyzing trace with hash 708648187, now seen corresponding path program 5 times [2018-10-04 14:24:14,767 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:14,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:14,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:14,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:14,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:24:15,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:15,078 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:15,094 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:15,114 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-10-04 14:24:15,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:15,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:24:15,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:15,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-04 14:24:15,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-04 14:24:15,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-04 14:24:15,212 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:15,213 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 9 states. [2018-10-04 14:24:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:15,271 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-10-04 14:24:15,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 14:24:15,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-10-04 14:24:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:15,272 INFO L225 Difference]: With dead ends: 29 [2018-10-04 14:24:15,272 INFO L226 Difference]: Without dead ends: 22 [2018-10-04 14:24:15,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 7 [2018-10-04 14:24:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-04 14:24:15,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-04 14:24:15,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 14:24:15,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-10-04 14:24:15,278 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2018-10-04 14:24:15,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:15,279 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-10-04 14:24:15,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-04 14:24:15,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-10-04 14:24:15,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 14:24:15,280 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:15,280 INFO L375 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1] [2018-10-04 14:24:15,280 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:15,280 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:15,281 INFO L82 PathProgramCache]: Analyzing trace with hash 631006305, now seen corresponding path program 6 times [2018-10-04 14:24:15,281 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:15,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:15,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:15,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:15,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:15,570 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-04 14:24:15,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:15,571 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 14:24:15,582 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:15,597 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-04 14:24:15,598 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:15,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:15,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:15,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2018-10-04 14:24:15,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:24:15,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:24:15,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:15,845 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 19 states. [2018-10-04 14:24:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:16,159 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2018-10-04 14:24:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:24:16,159 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 21 [2018-10-04 14:24:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:16,161 INFO L225 Difference]: With dead ends: 46 [2018-10-04 14:24:16,161 INFO L226 Difference]: Without dead ends: 39 [2018-10-04 14:24:16,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 17 [2018-10-04 14:24:16,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-04 14:24:16,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-04 14:24:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-04 14:24:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2018-10-04 14:24:16,170 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 21 [2018-10-04 14:24:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:16,170 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2018-10-04 14:24:16,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:24:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-10-04 14:24:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-04 14:24:16,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:16,172 INFO L375 BasicCegarLoop]: trace histogram [17, 9, 8, 1, 1, 1] [2018-10-04 14:24:16,172 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:16,172 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:16,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1448674463, now seen corresponding path program 7 times [2018-10-04 14:24:16,172 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:16,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:16,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:16,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 14:24:16,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:16,348 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:16,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:16,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 72 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 14:24:16,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:16,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-04 14:24:16,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-04 14:24:16,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-04 14:24:16,491 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:16,492 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 11 states. [2018-10-04 14:24:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:16,578 INFO L93 Difference]: Finished difference Result 61 states and 80 transitions. [2018-10-04 14:24:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 14:24:16,581 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-04 14:24:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:16,582 INFO L225 Difference]: With dead ends: 61 [2018-10-04 14:24:16,582 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 14:24:16,583 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 14:24:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 14:24:16,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-04 14:24:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-04 14:24:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2018-10-04 14:24:16,589 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 37 [2018-10-04 14:24:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:16,590 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2018-10-04 14:24:16,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-04 14:24:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-10-04 14:24:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-04 14:24:16,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:16,592 INFO L375 BasicCegarLoop]: trace histogram [18, 9, 9, 1, 1, 1] [2018-10-04 14:24:16,592 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:16,592 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash 183991941, now seen corresponding path program 8 times [2018-10-04 14:24:16,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:16,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:16,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:16,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 14:24:16,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:16,751 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 14:24:16,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:16,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:16,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:16,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 170 proven. 90 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 14:24:16,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:16,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-04 14:24:16,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 14:24:16,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 14:24:16,903 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:16,903 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand 12 states. [2018-10-04 14:24:16,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:16,955 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2018-10-04 14:24:16,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 14:24:16,956 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-10-04 14:24:16,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:16,957 INFO L225 Difference]: With dead ends: 63 [2018-10-04 14:24:16,957 INFO L226 Difference]: Without dead ends: 42 [2018-10-04 14:24:16,957 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time 0.0s impTime 10 [2018-10-04 14:24:16,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-04 14:24:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-04 14:24:16,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 14:24:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-10-04 14:24:16,964 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 39 [2018-10-04 14:24:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:16,964 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-10-04 14:24:16,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 14:24:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-10-04 14:24:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 14:24:16,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:16,965 INFO L375 BasicCegarLoop]: trace histogram [19, 10, 9, 1, 1, 1] [2018-10-04 14:24:16,966 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:16,966 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:16,966 INFO L82 PathProgramCache]: Analyzing trace with hash 299833067, now seen corresponding path program 9 times [2018-10-04 14:24:16,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:16,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:16,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 187 proven. 110 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-10-04 14:24:17,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:17,140 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 14:24:17,148 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:17,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-10-04 14:24:17,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:17,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:17,503 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 37 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:17,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:17,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21] total 32 [2018-10-04 14:24:17,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:24:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:24:17,527 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:17,527 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 32 states. [2018-10-04 14:24:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:17,821 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2018-10-04 14:24:17,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:24:17,821 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-10-04 14:24:17,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:17,822 INFO L225 Difference]: With dead ends: 86 [2018-10-04 14:24:17,823 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 14:24:17,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 30 [2018-10-04 14:24:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 14:24:17,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-04 14:24:17,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-04 14:24:17,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2018-10-04 14:24:17,832 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 41 [2018-10-04 14:24:17,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:17,833 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2018-10-04 14:24:17,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:24:17,833 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2018-10-04 14:24:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-04 14:24:17,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:17,835 INFO L375 BasicCegarLoop]: trace histogram [30, 19, 11, 1, 1, 1] [2018-10-04 14:24:17,835 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:17,835 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash -156794911, now seen corresponding path program 10 times [2018-10-04 14:24:17,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:17,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:17,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:17,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:17,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 14:24:18,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:18,024 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 14:24:18,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:18,091 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:18,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:18,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:18,400 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 444 proven. 132 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 14:24:18,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:18,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-04 14:24:18,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 14:24:18,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 14:24:18,423 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:18,423 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand 14 states. [2018-10-04 14:24:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:18,523 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2018-10-04 14:24:18,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 14:24:18,524 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2018-10-04 14:24:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:18,525 INFO L225 Difference]: With dead ends: 107 [2018-10-04 14:24:18,525 INFO L226 Difference]: Without dead ends: 66 [2018-10-04 14:24:18,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime 12 [2018-10-04 14:24:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-04 14:24:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-04 14:24:18,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-04 14:24:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2018-10-04 14:24:18,534 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 63 [2018-10-04 14:24:18,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:18,534 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2018-10-04 14:24:18,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 14:24:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2018-10-04 14:24:18,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 14:24:18,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:18,536 INFO L375 BasicCegarLoop]: trace histogram [31, 19, 12, 1, 1, 1] [2018-10-04 14:24:18,536 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:18,536 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:18,536 INFO L82 PathProgramCache]: Analyzing trace with hash -779762105, now seen corresponding path program 11 times [2018-10-04 14:24:18,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:18,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:18,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:18,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:18,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 14:24:18,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:18,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 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 14:24:18,758 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:18,869 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2018-10-04 14:24:18,870 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:18,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 481 proven. 156 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 14:24:19,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:19,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-04 14:24:19,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-04 14:24:19,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-04 14:24:19,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:19,184 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 15 states. [2018-10-04 14:24:19,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:19,306 INFO L93 Difference]: Finished difference Result 109 states and 148 transitions. [2018-10-04 14:24:19,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 14:24:19,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-10-04 14:24:19,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:19,308 INFO L225 Difference]: With dead ends: 109 [2018-10-04 14:24:19,308 INFO L226 Difference]: Without dead ends: 68 [2018-10-04 14:24:19,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.0s impTime 13 [2018-10-04 14:24:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-04 14:24:19,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-04 14:24:19,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-04 14:24:19,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2018-10-04 14:24:19,316 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 65 [2018-10-04 14:24:19,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:19,317 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2018-10-04 14:24:19,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-04 14:24:19,317 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2018-10-04 14:24:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-04 14:24:19,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:19,318 INFO L375 BasicCegarLoop]: trace histogram [32, 19, 13, 1, 1, 1] [2018-10-04 14:24:19,319 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:19,319 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:19,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1844185901, now seen corresponding path program 12 times [2018-10-04 14:24:19,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:19,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:19,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:19,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:19,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 518 proven. 182 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2018-10-04 14:24:19,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:19,612 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:19,620 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:19,685 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2018-10-04 14:24:19,685 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:19,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 507 proven. 361 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-10-04 14:24:20,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:20,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 36 [2018-10-04 14:24:20,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:24:20,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:24:20,300 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:20,300 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 36 states. [2018-10-04 14:24:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:20,590 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2018-10-04 14:24:20,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:24:20,591 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-10-04 14:24:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:20,592 INFO L225 Difference]: With dead ends: 114 [2018-10-04 14:24:20,592 INFO L226 Difference]: Without dead ends: 73 [2018-10-04 14:24:20,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 34 [2018-10-04 14:24:20,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-04 14:24:20,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-04 14:24:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 14:24:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-10-04 14:24:20,601 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 67 [2018-10-04 14:24:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:20,601 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-10-04 14:24:20,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:24:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-10-04 14:24:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 14:24:20,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:20,603 INFO L375 BasicCegarLoop]: trace histogram [34, 20, 14, 1, 1, 1] [2018-10-04 14:24:20,603 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:20,603 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:20,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1734502011, now seen corresponding path program 13 times [2018-10-04 14:24:20,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:20,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:20,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:20,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:20,937 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 14:24:20,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:20,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 585 proven. 210 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:21,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:21,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-04 14:24:21,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-04 14:24:21,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-04 14:24:21,080 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:21,080 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 17 states. [2018-10-04 14:24:21,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:21,167 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2018-10-04 14:24:21,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 14:24:21,168 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2018-10-04 14:24:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:21,169 INFO L225 Difference]: With dead ends: 117 [2018-10-04 14:24:21,169 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 14:24:21,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.1s impTime 15 [2018-10-04 14:24:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 14:24:21,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 14:24:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 14:24:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2018-10-04 14:24:21,177 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 71 [2018-10-04 14:24:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:21,177 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2018-10-04 14:24:21,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-04 14:24:21,177 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2018-10-04 14:24:21,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-04 14:24:21,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:21,179 INFO L375 BasicCegarLoop]: trace histogram [35, 20, 15, 1, 1, 1] [2018-10-04 14:24:21,179 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:21,179 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:21,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1306453729, now seen corresponding path program 14 times [2018-10-04 14:24:21,179 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:21,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:21,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:21,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:21,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:21,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:21,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:21,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 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 14:24:21,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:21,852 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:21,852 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:21,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:22,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 624 proven. 240 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:22,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:22,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-04 14:24:22,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 14:24:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 14:24:22,076 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:22,076 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 18 states. [2018-10-04 14:24:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:22,180 INFO L93 Difference]: Finished difference Result 119 states and 160 transitions. [2018-10-04 14:24:22,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 14:24:22,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 73 [2018-10-04 14:24:22,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:22,183 INFO L225 Difference]: With dead ends: 119 [2018-10-04 14:24:22,183 INFO L226 Difference]: Without dead ends: 76 [2018-10-04 14:24:22,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.3s impTime 16 [2018-10-04 14:24:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-04 14:24:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-04 14:24:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-04 14:24:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-10-04 14:24:22,190 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 73 [2018-10-04 14:24:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:22,190 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2018-10-04 14:24:22,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 14:24:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2018-10-04 14:24:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-04 14:24:22,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:22,192 INFO L375 BasicCegarLoop]: trace histogram [36, 20, 16, 1, 1, 1] [2018-10-04 14:24:22,192 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:22,193 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2026052153, now seen corresponding path program 15 times [2018-10-04 14:24:22,193 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:22,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:22,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:22,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:22,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:22,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:22,519 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 14:24:22,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:22,569 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-10-04 14:24:22,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:22,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:22,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 663 proven. 272 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:22,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:22,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-04 14:24:22,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-04 14:24:22,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-04 14:24:22,670 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:22,670 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand 19 states. [2018-10-04 14:24:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:22,729 INFO L93 Difference]: Finished difference Result 121 states and 162 transitions. [2018-10-04 14:24:22,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 14:24:22,729 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2018-10-04 14:24:22,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:22,730 INFO L225 Difference]: With dead ends: 121 [2018-10-04 14:24:22,730 INFO L226 Difference]: Without dead ends: 78 [2018-10-04 14:24:22,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 17 [2018-10-04 14:24:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-04 14:24:22,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-04 14:24:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-04 14:24:22,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2018-10-04 14:24:22,738 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 75 [2018-10-04 14:24:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:22,738 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2018-10-04 14:24:22,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-04 14:24:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2018-10-04 14:24:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-04 14:24:22,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:22,745 INFO L375 BasicCegarLoop]: trace histogram [37, 20, 17, 1, 1, 1] [2018-10-04 14:24:22,745 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:22,745 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash -518601939, now seen corresponding path program 16 times [2018-10-04 14:24:22,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:22,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:22,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:22,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:23,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:23,162 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 14:24:23,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:23,208 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:23,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:23,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:23,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 702 proven. 306 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:23,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:23,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-04 14:24:23,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 14:24:23,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 14:24:23,408 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:23,408 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand 20 states. [2018-10-04 14:24:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:23,489 INFO L93 Difference]: Finished difference Result 123 states and 164 transitions. [2018-10-04 14:24:23,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 14:24:23,490 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 77 [2018-10-04 14:24:23,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:23,491 INFO L225 Difference]: With dead ends: 123 [2018-10-04 14:24:23,491 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 14:24:23,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.2s impTime 18 [2018-10-04 14:24:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 14:24:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 14:24:23,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 14:24:23,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2018-10-04 14:24:23,499 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 77 [2018-10-04 14:24:23,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:23,499 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2018-10-04 14:24:23,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 14:24:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2018-10-04 14:24:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-04 14:24:23,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:23,504 INFO L375 BasicCegarLoop]: trace histogram [38, 20, 18, 1, 1, 1] [2018-10-04 14:24:23,504 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:23,504 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 737074963, now seen corresponding path program 17 times [2018-10-04 14:24:23,505 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:23,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:23,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:23,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:23,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:23,818 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:23,892 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2018-10-04 14:24:23,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:23,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 741 proven. 342 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:24,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:24,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-04 14:24:24,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-04 14:24:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-04 14:24:24,029 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:24,029 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 21 states. [2018-10-04 14:24:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:24,106 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2018-10-04 14:24:24,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 14:24:24,106 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-10-04 14:24:24,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:24,107 INFO L225 Difference]: With dead ends: 125 [2018-10-04 14:24:24,107 INFO L226 Difference]: Without dead ends: 82 [2018-10-04 14:24:24,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time 0.2s impTime 19 [2018-10-04 14:24:24,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-04 14:24:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-04 14:24:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 14:24:24,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2018-10-04 14:24:24,112 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 79 [2018-10-04 14:24:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:24,113 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2018-10-04 14:24:24,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-04 14:24:24,113 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2018-10-04 14:24:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 14:24:24,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:24,114 INFO L375 BasicCegarLoop]: trace histogram [39, 20, 19, 1, 1, 1] [2018-10-04 14:24:24,115 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:24,115 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:24,115 INFO L82 PathProgramCache]: Analyzing trace with hash 556767609, now seen corresponding path program 18 times [2018-10-04 14:24:24,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:24,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:24,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 780 proven. 380 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-10-04 14:24:24,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:24,493 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 14:24:24,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:24,541 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 39 check-sat command(s) [2018-10-04 14:24:24,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:24,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 779 proven. 400 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2018-10-04 14:24:25,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:25,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 43 [2018-10-04 14:24:25,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:24:25,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:24:25,072 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:25,072 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 43 states. [2018-10-04 14:24:25,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:25,393 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2018-10-04 14:24:25,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:24:25,394 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 81 [2018-10-04 14:24:25,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:25,395 INFO L225 Difference]: With dead ends: 130 [2018-10-04 14:24:25,395 INFO L226 Difference]: Without dead ends: 87 [2018-10-04 14:24:25,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 41 [2018-10-04 14:24:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-04 14:24:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-04 14:24:25,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-04 14:24:25,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2018-10-04 14:24:25,400 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 81 [2018-10-04 14:24:25,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:25,401 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2018-10-04 14:24:25,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:24:25,401 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2018-10-04 14:24:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-04 14:24:25,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:25,402 INFO L375 BasicCegarLoop]: trace histogram [41, 21, 20, 1, 1, 1] [2018-10-04 14:24:25,402 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:25,402 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:25,402 INFO L82 PathProgramCache]: Analyzing trace with hash 731858759, now seen corresponding path program 19 times [2018-10-04 14:24:25,402 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:25,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:25,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:25,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 14:24:26,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:26,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:26,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:26,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 861 proven. 420 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 14:24:26,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:26,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-04 14:24:26,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-04 14:24:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-04 14:24:26,691 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:26,691 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 23 states. [2018-10-04 14:24:26,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:26,796 INFO L93 Difference]: Finished difference Result 133 states and 176 transitions. [2018-10-04 14:24:26,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 14:24:26,797 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-10-04 14:24:26,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:26,798 INFO L225 Difference]: With dead ends: 133 [2018-10-04 14:24:26,798 INFO L226 Difference]: Without dead ends: 88 [2018-10-04 14:24:26,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.8s impTime 21 [2018-10-04 14:24:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-04 14:24:26,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-10-04 14:24:26,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-04 14:24:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 109 transitions. [2018-10-04 14:24:26,802 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 109 transitions. Word has length 85 [2018-10-04 14:24:26,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:26,803 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 109 transitions. [2018-10-04 14:24:26,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-04 14:24:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 109 transitions. [2018-10-04 14:24:26,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-04 14:24:26,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:26,804 INFO L375 BasicCegarLoop]: trace histogram [42, 21, 21, 1, 1, 1] [2018-10-04 14:24:26,804 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:26,804 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:26,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1951916755, now seen corresponding path program 20 times [2018-10-04 14:24:26,804 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:26,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:26,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:26,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 14:24:27,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:27,630 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:27,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:27,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:27,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 902 proven. 462 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 14:24:27,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:27,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-04 14:24:27,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 14:24:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 14:24:27,864 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:27,864 INFO L87 Difference]: Start difference. First operand 88 states and 109 transitions. Second operand 24 states. [2018-10-04 14:24:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:27,964 INFO L93 Difference]: Finished difference Result 135 states and 178 transitions. [2018-10-04 14:24:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 14:24:27,966 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 87 [2018-10-04 14:24:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:27,968 INFO L225 Difference]: With dead ends: 135 [2018-10-04 14:24:27,968 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 14:24:27,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.5s impTime 22 [2018-10-04 14:24:27,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 14:24:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-10-04 14:24:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-04 14:24:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2018-10-04 14:24:27,973 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 87 [2018-10-04 14:24:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:27,973 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2018-10-04 14:24:27,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 14:24:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2018-10-04 14:24:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-04 14:24:27,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:27,975 INFO L375 BasicCegarLoop]: trace histogram [43, 22, 21, 1, 1, 1] [2018-10-04 14:24:27,975 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:27,975 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:27,975 INFO L82 PathProgramCache]: Analyzing trace with hash 215159187, now seen corresponding path program 21 times [2018-10-04 14:24:27,975 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:27,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:27,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:27,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 943 proven. 506 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2018-10-04 14:24:28,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:28,246 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 14:24:28,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:28,306 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-10-04 14:24:28,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:28,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 85 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:24:29,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:29,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 45] total 68 [2018-10-04 14:24:29,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 14:24:29,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 14:24:29,189 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:29,189 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand 68 states. [2018-10-04 14:24:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:29,920 INFO L93 Difference]: Finished difference Result 182 states and 270 transitions. [2018-10-04 14:24:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-04 14:24:29,921 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 89 [2018-10-04 14:24:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:29,922 INFO L225 Difference]: With dead ends: 182 [2018-10-04 14:24:29,922 INFO L226 Difference]: Without dead ends: 137 [2018-10-04 14:24:29,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 66 [2018-10-04 14:24:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-04 14:24:29,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-10-04 14:24:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-04 14:24:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions. [2018-10-04 14:24:29,930 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 89 [2018-10-04 14:24:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:29,930 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 179 transitions. [2018-10-04 14:24:29,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 14:24:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions. [2018-10-04 14:24:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-04 14:24:29,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:29,931 INFO L375 BasicCegarLoop]: trace histogram [66, 43, 23, 1, 1, 1] [2018-10-04 14:24:29,931 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:29,931 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:29,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1550474089, now seen corresponding path program 22 times [2018-10-04 14:24:29,932 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:29,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:29,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:29,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 14:24:30,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:30,441 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:30,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:30,495 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:30,495 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:30,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 2040 proven. 552 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 14:24:30,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:30,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-04 14:24:30,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 14:24:30,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 14:24:30,658 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:30,658 INFO L87 Difference]: Start difference. First operand 136 states and 179 transitions. Second operand 26 states. [2018-10-04 14:24:30,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:30,747 INFO L93 Difference]: Finished difference Result 227 states and 314 transitions. [2018-10-04 14:24:30,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 14:24:30,747 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2018-10-04 14:24:30,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:30,748 INFO L225 Difference]: With dead ends: 227 [2018-10-04 14:24:30,748 INFO L226 Difference]: Without dead ends: 138 [2018-10-04 14:24:30,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 24 [2018-10-04 14:24:30,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-04 14:24:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-10-04 14:24:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-04 14:24:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2018-10-04 14:24:30,754 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 135 [2018-10-04 14:24:30,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:30,755 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2018-10-04 14:24:30,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 14:24:30,755 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2018-10-04 14:24:30,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-04 14:24:30,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:30,756 INFO L375 BasicCegarLoop]: trace histogram [67, 43, 24, 1, 1, 1] [2018-10-04 14:24:30,756 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:30,756 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:30,756 INFO L82 PathProgramCache]: Analyzing trace with hash 422620111, now seen corresponding path program 23 times [2018-10-04 14:24:30,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:30,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:30,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:30,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 14:24:31,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:31,237 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 14:24:31,246 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:31,339 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 68 check-sat command(s) [2018-10-04 14:24:31,340 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:31,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 2125 proven. 600 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 14:24:31,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:31,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-04 14:24:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-04 14:24:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-04 14:24:31,481 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:31,481 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand 27 states. [2018-10-04 14:24:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:31,593 INFO L93 Difference]: Finished difference Result 229 states and 316 transitions. [2018-10-04 14:24:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 14:24:31,594 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 137 [2018-10-04 14:24:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:31,595 INFO L225 Difference]: With dead ends: 229 [2018-10-04 14:24:31,595 INFO L226 Difference]: Without dead ends: 140 [2018-10-04 14:24:31,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.3s impTime 25 [2018-10-04 14:24:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-04 14:24:31,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-10-04 14:24:31,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-04 14:24:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 183 transitions. [2018-10-04 14:24:31,602 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 183 transitions. Word has length 137 [2018-10-04 14:24:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:31,602 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 183 transitions. [2018-10-04 14:24:31,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-04 14:24:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 183 transitions. [2018-10-04 14:24:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-04 14:24:31,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:31,603 INFO L375 BasicCegarLoop]: trace histogram [68, 43, 25, 1, 1, 1] [2018-10-04 14:24:31,603 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:31,603 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:31,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1113294155, now seen corresponding path program 24 times [2018-10-04 14:24:31,604 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:31,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:31,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:31,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:31,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2210 proven. 650 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2018-10-04 14:24:32,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:32,051 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 14:24:32,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:32,160 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 68 check-sat command(s) [2018-10-04 14:24:32,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:32,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 2175 proven. 1849 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2018-10-04 14:24:32,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:32,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 46] total 72 [2018-10-04 14:24:32,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 14:24:32,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 14:24:32,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:32,869 INFO L87 Difference]: Start difference. First operand 140 states and 183 transitions. Second operand 72 states. [2018-10-04 14:24:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:33,808 INFO L93 Difference]: Finished difference Result 234 states and 324 transitions. [2018-10-04 14:24:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-04 14:24:33,809 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 139 [2018-10-04 14:24:33,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:33,809 INFO L225 Difference]: With dead ends: 234 [2018-10-04 14:24:33,810 INFO L226 Difference]: Without dead ends: 145 [2018-10-04 14:24:33,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 70 [2018-10-04 14:24:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-04 14:24:33,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-10-04 14:24:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-04 14:24:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 188 transitions. [2018-10-04 14:24:33,815 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 188 transitions. Word has length 139 [2018-10-04 14:24:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:33,815 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 188 transitions. [2018-10-04 14:24:33,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 14:24:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2018-10-04 14:24:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-04 14:24:33,816 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:33,816 INFO L375 BasicCegarLoop]: trace histogram [70, 44, 26, 1, 1, 1] [2018-10-04 14:24:33,816 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:33,816 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash 2096471555, now seen corresponding path program 25 times [2018-10-04 14:24:33,816 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:33,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:33,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:33,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:34,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:34,525 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 14:24:34,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:34,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2349 proven. 702 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:34,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:34,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-04 14:24:34,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-04 14:24:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-04 14:24:34,785 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:34,785 INFO L87 Difference]: Start difference. First operand 144 states and 188 transitions. Second operand 29 states. [2018-10-04 14:24:34,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:34,961 INFO L93 Difference]: Finished difference Result 237 states and 326 transitions. [2018-10-04 14:24:34,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 14:24:34,961 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 143 [2018-10-04 14:24:34,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:34,962 INFO L225 Difference]: With dead ends: 237 [2018-10-04 14:24:34,962 INFO L226 Difference]: Without dead ends: 146 [2018-10-04 14:24:34,963 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 27 [2018-10-04 14:24:34,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-04 14:24:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-10-04 14:24:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-04 14:24:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 190 transitions. [2018-10-04 14:24:34,969 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 190 transitions. Word has length 143 [2018-10-04 14:24:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:34,970 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 190 transitions. [2018-10-04 14:24:34,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-04 14:24:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 190 transitions. [2018-10-04 14:24:34,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-04 14:24:34,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:34,971 INFO L375 BasicCegarLoop]: trace histogram [71, 44, 27, 1, 1, 1] [2018-10-04 14:24:34,972 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:34,972 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:34,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1984944023, now seen corresponding path program 26 times [2018-10-04 14:24:34,972 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:34,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:34,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:34,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:34,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:35,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:35,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:35,592 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 14:24:35,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:35,652 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:35,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:35,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2436 proven. 756 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:35,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:35,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-04 14:24:35,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 14:24:35,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 14:24:35,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:35,933 INFO L87 Difference]: Start difference. First operand 146 states and 190 transitions. Second operand 30 states. [2018-10-04 14:24:36,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:36,056 INFO L93 Difference]: Finished difference Result 239 states and 328 transitions. [2018-10-04 14:24:36,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 14:24:36,057 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 145 [2018-10-04 14:24:36,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:36,059 INFO L225 Difference]: With dead ends: 239 [2018-10-04 14:24:36,059 INFO L226 Difference]: Without dead ends: 148 [2018-10-04 14:24:36,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 28 [2018-10-04 14:24:36,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-04 14:24:36,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-10-04 14:24:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-04 14:24:36,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 192 transitions. [2018-10-04 14:24:36,066 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 192 transitions. Word has length 145 [2018-10-04 14:24:36,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:36,066 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 192 transitions. [2018-10-04 14:24:36,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 14:24:36,066 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 192 transitions. [2018-10-04 14:24:36,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-04 14:24:36,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:36,067 INFO L375 BasicCegarLoop]: trace histogram [72, 44, 28, 1, 1, 1] [2018-10-04 14:24:36,068 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:36,068 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:36,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1374794063, now seen corresponding path program 27 times [2018-10-04 14:24:36,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:36,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:36,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:36,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:36,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:37,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:37,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:37,121 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:37,207 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-10-04 14:24:37,208 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:37,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 2523 proven. 812 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:37,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:37,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-04 14:24:37,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-04 14:24:37,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-04 14:24:37,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:37,351 INFO L87 Difference]: Start difference. First operand 148 states and 192 transitions. Second operand 31 states. [2018-10-04 14:24:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:37,533 INFO L93 Difference]: Finished difference Result 241 states and 330 transitions. [2018-10-04 14:24:37,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 14:24:37,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 147 [2018-10-04 14:24:37,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:37,536 INFO L225 Difference]: With dead ends: 241 [2018-10-04 14:24:37,536 INFO L226 Difference]: Without dead ends: 150 [2018-10-04 14:24:37,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time 0.7s impTime 29 [2018-10-04 14:24:37,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-04 14:24:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-10-04 14:24:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-04 14:24:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 194 transitions. [2018-10-04 14:24:37,544 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 194 transitions. Word has length 147 [2018-10-04 14:24:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:37,544 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 194 transitions. [2018-10-04 14:24:37,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-04 14:24:37,544 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 194 transitions. [2018-10-04 14:24:37,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-04 14:24:37,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:37,545 INFO L375 BasicCegarLoop]: trace histogram [73, 44, 29, 1, 1, 1] [2018-10-04 14:24:37,545 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:37,546 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:37,546 INFO L82 PathProgramCache]: Analyzing trace with hash 267688117, now seen corresponding path program 28 times [2018-10-04 14:24:37,546 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:37,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:37,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:37,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:37,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:38,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:38,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:38,531 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 14:24:38,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:38,607 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:38,607 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:38,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 2610 proven. 870 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:38,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:38,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-04 14:24:38,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 14:24:38,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 14:24:38,917 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:38,917 INFO L87 Difference]: Start difference. First operand 150 states and 194 transitions. Second operand 32 states. [2018-10-04 14:24:39,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:39,063 INFO L93 Difference]: Finished difference Result 243 states and 332 transitions. [2018-10-04 14:24:39,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 14:24:39,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 149 [2018-10-04 14:24:39,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:39,065 INFO L225 Difference]: With dead ends: 243 [2018-10-04 14:24:39,065 INFO L226 Difference]: Without dead ends: 152 [2018-10-04 14:24:39,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.6s impTime 30 [2018-10-04 14:24:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-04 14:24:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-10-04 14:24:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-04 14:24:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 196 transitions. [2018-10-04 14:24:39,072 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 196 transitions. Word has length 149 [2018-10-04 14:24:39,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:39,072 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 196 transitions. [2018-10-04 14:24:39,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 14:24:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 196 transitions. [2018-10-04 14:24:39,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-04 14:24:39,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:39,073 INFO L375 BasicCegarLoop]: trace histogram [74, 44, 30, 1, 1, 1] [2018-10-04 14:24:39,073 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:39,073 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1490763419, now seen corresponding path program 29 times [2018-10-04 14:24:39,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:39,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:39,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:39,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:39,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:39,502 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 14:24:39,524 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:39,674 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 75 check-sat command(s) [2018-10-04 14:24:39,674 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:39,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:39,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2697 proven. 930 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:39,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:39,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-04 14:24:39,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-04 14:24:39,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-04 14:24:39,830 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:39,830 INFO L87 Difference]: Start difference. First operand 152 states and 196 transitions. Second operand 33 states. [2018-10-04 14:24:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:40,154 INFO L93 Difference]: Finished difference Result 245 states and 334 transitions. [2018-10-04 14:24:40,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 14:24:40,154 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 151 [2018-10-04 14:24:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:40,155 INFO L225 Difference]: With dead ends: 245 [2018-10-04 14:24:40,155 INFO L226 Difference]: Without dead ends: 154 [2018-10-04 14:24:40,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time 0.2s impTime 31 [2018-10-04 14:24:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-04 14:24:40,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-10-04 14:24:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-04 14:24:40,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 198 transitions. [2018-10-04 14:24:40,163 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 198 transitions. Word has length 151 [2018-10-04 14:24:40,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:40,164 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 198 transitions. [2018-10-04 14:24:40,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-04 14:24:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 198 transitions. [2018-10-04 14:24:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-04 14:24:40,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:40,165 INFO L375 BasicCegarLoop]: trace histogram [75, 44, 31, 1, 1, 1] [2018-10-04 14:24:40,165 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:40,165 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash 45089537, now seen corresponding path program 30 times [2018-10-04 14:24:40,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:40,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:40,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:40,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:40,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2784 proven. 992 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2018-10-04 14:24:40,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:40,884 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 14:24:40,891 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:40,995 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 75 check-sat command(s) [2018-10-04 14:24:40,995 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:40,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 2759 proven. 1936 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2018-10-04 14:24:41,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:41,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 47] total 79 [2018-10-04 14:24:41,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-04 14:24:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-04 14:24:41,603 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:41,603 INFO L87 Difference]: Start difference. First operand 154 states and 198 transitions. Second operand 79 states. [2018-10-04 14:24:42,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:42,409 INFO L93 Difference]: Finished difference Result 250 states and 342 transitions. [2018-10-04 14:24:42,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-04 14:24:42,409 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 153 [2018-10-04 14:24:42,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:42,410 INFO L225 Difference]: With dead ends: 250 [2018-10-04 14:24:42,410 INFO L226 Difference]: Without dead ends: 159 [2018-10-04 14:24:42,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 77 [2018-10-04 14:24:42,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-04 14:24:42,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-10-04 14:24:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-04 14:24:42,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 203 transitions. [2018-10-04 14:24:42,416 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 203 transitions. Word has length 153 [2018-10-04 14:24:42,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:42,417 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 203 transitions. [2018-10-04 14:24:42,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-04 14:24:42,417 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 203 transitions. [2018-10-04 14:24:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-04 14:24:42,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:42,418 INFO L375 BasicCegarLoop]: trace histogram [77, 45, 32, 1, 1, 1] [2018-10-04 14:24:42,418 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:42,418 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2044036913, now seen corresponding path program 31 times [2018-10-04 14:24:42,419 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:42,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:42,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:42,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:42,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:43,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:43,075 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 14:24:43,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:43,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:43,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2937 proven. 1056 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:43,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:43,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-04 14:24:43,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-04 14:24:43,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-04 14:24:43,297 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:43,297 INFO L87 Difference]: Start difference. First operand 158 states and 203 transitions. Second operand 35 states. [2018-10-04 14:24:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:43,433 INFO L93 Difference]: Finished difference Result 253 states and 344 transitions. [2018-10-04 14:24:43,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 14:24:43,434 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 157 [2018-10-04 14:24:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:43,436 INFO L225 Difference]: With dead ends: 253 [2018-10-04 14:24:43,436 INFO L226 Difference]: Without dead ends: 160 [2018-10-04 14:24:43,436 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time 0.4s impTime 33 [2018-10-04 14:24:43,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-04 14:24:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-10-04 14:24:43,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-04 14:24:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 205 transitions. [2018-10-04 14:24:43,443 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 205 transitions. Word has length 157 [2018-10-04 14:24:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:43,443 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 205 transitions. [2018-10-04 14:24:43,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-04 14:24:43,443 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2018-10-04 14:24:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-04 14:24:43,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:43,444 INFO L375 BasicCegarLoop]: trace histogram [78, 45, 33, 1, 1, 1] [2018-10-04 14:24:43,445 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:43,445 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash -635971403, now seen corresponding path program 32 times [2018-10-04 14:24:43,445 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:43,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:43,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:43,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:44,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:44,083 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:44,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:44,177 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:44,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:44,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 3026 proven. 1122 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:44,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:44,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-04 14:24:44,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 14:24:44,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 14:24:44,784 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:44,784 INFO L87 Difference]: Start difference. First operand 160 states and 205 transitions. Second operand 36 states. [2018-10-04 14:24:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:44,996 INFO L93 Difference]: Finished difference Result 255 states and 346 transitions. [2018-10-04 14:24:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 14:24:44,996 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 159 [2018-10-04 14:24:44,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:44,998 INFO L225 Difference]: With dead ends: 255 [2018-10-04 14:24:44,998 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 14:24:44,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.4s impTime 34 [2018-10-04 14:24:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 14:24:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-04 14:24:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 14:24:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 207 transitions. [2018-10-04 14:24:45,005 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 207 transitions. Word has length 159 [2018-10-04 14:24:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:45,005 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 207 transitions. [2018-10-04 14:24:45,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 14:24:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 207 transitions. [2018-10-04 14:24:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-04 14:24:45,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:45,006 INFO L375 BasicCegarLoop]: trace histogram [79, 45, 34, 1, 1, 1] [2018-10-04 14:24:45,007 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:45,007 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash -399714533, now seen corresponding path program 33 times [2018-10-04 14:24:45,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:45,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:45,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:45,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:46,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:46,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:46,079 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:46,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:46,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2018-10-04 14:24:46,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:46,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:46,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 3115 proven. 1190 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:46,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:46,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-04 14:24:46,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-04 14:24:46,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-04 14:24:46,408 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:46,408 INFO L87 Difference]: Start difference. First operand 162 states and 207 transitions. Second operand 37 states. [2018-10-04 14:24:46,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:46,704 INFO L93 Difference]: Finished difference Result 257 states and 348 transitions. [2018-10-04 14:24:46,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 14:24:46,705 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 161 [2018-10-04 14:24:46,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:46,705 INFO L225 Difference]: With dead ends: 257 [2018-10-04 14:24:46,705 INFO L226 Difference]: Without dead ends: 164 [2018-10-04 14:24:46,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.7s impTime 35 [2018-10-04 14:24:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-04 14:24:46,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-10-04 14:24:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-04 14:24:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 209 transitions. [2018-10-04 14:24:46,711 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 209 transitions. Word has length 161 [2018-10-04 14:24:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:46,712 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 209 transitions. [2018-10-04 14:24:46,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-04 14:24:46,712 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 209 transitions. [2018-10-04 14:24:46,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-04 14:24:46,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:46,713 INFO L375 BasicCegarLoop]: trace histogram [80, 45, 35, 1, 1, 1] [2018-10-04 14:24:46,713 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:46,713 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:46,713 INFO L82 PathProgramCache]: Analyzing trace with hash -990129151, now seen corresponding path program 34 times [2018-10-04 14:24:46,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:46,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:46,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:46,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:46,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:48,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:48,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 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 14:24:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:24:48,169 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:24:48,169 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:48,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:48,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3204 proven. 1260 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:48,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:48,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-04 14:24:48,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 14:24:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 14:24:48,351 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:48,351 INFO L87 Difference]: Start difference. First operand 164 states and 209 transitions. Second operand 38 states. [2018-10-04 14:24:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:48,487 INFO L93 Difference]: Finished difference Result 259 states and 350 transitions. [2018-10-04 14:24:48,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 14:24:48,488 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 163 [2018-10-04 14:24:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:48,489 INFO L225 Difference]: With dead ends: 259 [2018-10-04 14:24:48,489 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 14:24:48,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time 1.0s impTime 36 [2018-10-04 14:24:48,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 14:24:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 14:24:48,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 14:24:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 211 transitions. [2018-10-04 14:24:48,495 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 211 transitions. Word has length 163 [2018-10-04 14:24:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:48,495 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 211 transitions. [2018-10-04 14:24:48,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 14:24:48,495 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 211 transitions. [2018-10-04 14:24:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-04 14:24:48,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:48,496 INFO L375 BasicCegarLoop]: trace histogram [81, 45, 36, 1, 1, 1] [2018-10-04 14:24:48,496 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:48,496 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:48,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1442893977, now seen corresponding path program 35 times [2018-10-04 14:24:48,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:48,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:48,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:48,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:48,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:49,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:49,650 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 14:24:49,658 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:24:49,793 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 82 check-sat command(s) [2018-10-04 14:24:49,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:49,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 3293 proven. 1332 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:50,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:50,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-04 14:24:50,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-04 14:24:50,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-04 14:24:50,112 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:50,113 INFO L87 Difference]: Start difference. First operand 166 states and 211 transitions. Second operand 39 states. [2018-10-04 14:24:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:51,075 INFO L93 Difference]: Finished difference Result 261 states and 352 transitions. [2018-10-04 14:24:51,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 14:24:51,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 165 [2018-10-04 14:24:51,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:51,077 INFO L225 Difference]: With dead ends: 261 [2018-10-04 14:24:51,078 INFO L226 Difference]: Without dead ends: 168 [2018-10-04 14:24:51,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.8s impTime 37 [2018-10-04 14:24:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-04 14:24:51,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-10-04 14:24:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-04 14:24:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2018-10-04 14:24:51,084 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 165 [2018-10-04 14:24:51,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:51,085 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2018-10-04 14:24:51,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-04 14:24:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2018-10-04 14:24:51,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-04 14:24:51,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:51,086 INFO L375 BasicCegarLoop]: trace histogram [82, 45, 37, 1, 1, 1] [2018-10-04 14:24:51,086 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:51,086 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1536772429, now seen corresponding path program 36 times [2018-10-04 14:24:51,087 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:51,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:51,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:51,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:52,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:52,482 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:52,490 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:24:53,183 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 82 check-sat command(s) [2018-10-04 14:24:53,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:53,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 3382 proven. 1406 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:54,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:54,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-04 14:24:54,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 14:24:54,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 14:24:54,541 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:54,541 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand 40 states. [2018-10-04 14:24:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:54,694 INFO L93 Difference]: Finished difference Result 263 states and 354 transitions. [2018-10-04 14:24:54,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 14:24:54,695 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 167 [2018-10-04 14:24:54,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:54,696 INFO L225 Difference]: With dead ends: 263 [2018-10-04 14:24:54,696 INFO L226 Difference]: Without dead ends: 170 [2018-10-04 14:24:54,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time 1.0s impTime 38 [2018-10-04 14:24:54,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-04 14:24:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-10-04 14:24:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-04 14:24:54,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 215 transitions. [2018-10-04 14:24:54,704 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 215 transitions. Word has length 167 [2018-10-04 14:24:54,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:54,704 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 215 transitions. [2018-10-04 14:24:54,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 14:24:54,704 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 215 transitions. [2018-10-04 14:24:54,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-04 14:24:54,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:54,705 INFO L375 BasicCegarLoop]: trace histogram [83, 45, 38, 1, 1, 1] [2018-10-04 14:24:54,706 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:54,706 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash 253002163, now seen corresponding path program 37 times [2018-10-04 14:24:54,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:54,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:54,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:54,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:55,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:55,895 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 14:24:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:55,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3471 proven. 1482 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:56,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:56,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-04 14:24:56,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-04 14:24:56,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-04 14:24:56,257 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:56,258 INFO L87 Difference]: Start difference. First operand 170 states and 215 transitions. Second operand 41 states. [2018-10-04 14:24:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:56,421 INFO L93 Difference]: Finished difference Result 265 states and 356 transitions. [2018-10-04 14:24:56,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 14:24:56,421 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-10-04 14:24:56,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:56,423 INFO L225 Difference]: With dead ends: 265 [2018-10-04 14:24:56,423 INFO L226 Difference]: Without dead ends: 172 [2018-10-04 14:24:56,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 1.0s impTime 39 [2018-10-04 14:24:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-04 14:24:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-10-04 14:24:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-04 14:24:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 217 transitions. [2018-10-04 14:24:56,430 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 217 transitions. Word has length 169 [2018-10-04 14:24:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:56,430 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 217 transitions. [2018-10-04 14:24:56,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-04 14:24:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 217 transitions. [2018-10-04 14:24:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-04 14:24:56,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:56,432 INFO L375 BasicCegarLoop]: trace histogram [84, 45, 39, 1, 1, 1] [2018-10-04 14:24:56,432 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:56,432 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash -794609511, now seen corresponding path program 38 times [2018-10-04 14:24:56,432 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:56,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:24:56,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:57,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:57,202 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 14:24:57,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:24:57,267 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:24:57,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:57,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 3560 proven. 1560 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-04 14:24:57,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 14:24:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 14:24:57,454 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:57,454 INFO L87 Difference]: Start difference. First operand 172 states and 217 transitions. Second operand 42 states. [2018-10-04 14:24:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:57,588 INFO L93 Difference]: Finished difference Result 267 states and 358 transitions. [2018-10-04 14:24:57,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 14:24:57,588 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 171 [2018-10-04 14:24:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:57,589 INFO L225 Difference]: With dead ends: 267 [2018-10-04 14:24:57,589 INFO L226 Difference]: Without dead ends: 174 [2018-10-04 14:24:57,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time 0.5s impTime 40 [2018-10-04 14:24:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-04 14:24:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-10-04 14:24:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-04 14:24:57,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 219 transitions. [2018-10-04 14:24:57,595 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 219 transitions. Word has length 171 [2018-10-04 14:24:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:57,596 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 219 transitions. [2018-10-04 14:24:57,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 14:24:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 219 transitions. [2018-10-04 14:24:57,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-04 14:24:57,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:57,597 INFO L375 BasicCegarLoop]: trace histogram [85, 45, 40, 1, 1, 1] [2018-10-04 14:24:57,597 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:57,597 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:57,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1767886335, now seen corresponding path program 39 times [2018-10-04 14:24:57,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:57,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:57,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:24:58,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:58,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:24:58,757 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 14:24:58,764 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:24:58,881 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 83 check-sat command(s) [2018-10-04 14:24:58,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:24:58,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:24:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 3649 proven. 1640 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:24:59,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:24:59,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-04 14:24:59,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-04 14:24:59,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-04 14:24:59,113 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:24:59,113 INFO L87 Difference]: Start difference. First operand 174 states and 219 transitions. Second operand 43 states. [2018-10-04 14:24:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:24:59,284 INFO L93 Difference]: Finished difference Result 269 states and 360 transitions. [2018-10-04 14:24:59,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 14:24:59,284 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 173 [2018-10-04 14:24:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:24:59,286 INFO L225 Difference]: With dead ends: 269 [2018-10-04 14:24:59,286 INFO L226 Difference]: Without dead ends: 176 [2018-10-04 14:24:59,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.8s impTime 41 [2018-10-04 14:24:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-04 14:24:59,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-10-04 14:24:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-04 14:24:59,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 221 transitions. [2018-10-04 14:24:59,292 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 221 transitions. Word has length 173 [2018-10-04 14:24:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:24:59,292 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 221 transitions. [2018-10-04 14:24:59,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-04 14:24:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 221 transitions. [2018-10-04 14:24:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-04 14:24:59,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:24:59,294 INFO L375 BasicCegarLoop]: trace histogram [86, 45, 41, 1, 1, 1] [2018-10-04 14:24:59,294 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:24:59,294 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:24:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash -984833563, now seen corresponding path program 40 times [2018-10-04 14:24:59,294 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:24:59,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:24:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:24:59,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:24:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:25:00,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:00,924 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 14:25:00,931 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:01,011 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:01,011 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:01,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3738 proven. 1722 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:25:01,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:01,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-04 14:25:01,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 14:25:01,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 14:25:01,249 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:01,250 INFO L87 Difference]: Start difference. First operand 176 states and 221 transitions. Second operand 44 states. [2018-10-04 14:25:01,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:01,503 INFO L93 Difference]: Finished difference Result 271 states and 362 transitions. [2018-10-04 14:25:01,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 14:25:01,504 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 175 [2018-10-04 14:25:01,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:01,505 INFO L225 Difference]: With dead ends: 271 [2018-10-04 14:25:01,505 INFO L226 Difference]: Without dead ends: 178 [2018-10-04 14:25:01,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time 1.3s impTime 42 [2018-10-04 14:25:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-04 14:25:01,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-10-04 14:25:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-04 14:25:01,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 223 transitions. [2018-10-04 14:25:01,509 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 223 transitions. Word has length 175 [2018-10-04 14:25:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:01,510 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 223 transitions. [2018-10-04 14:25:01,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 14:25:01,510 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 223 transitions. [2018-10-04 14:25:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-04 14:25:01,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:01,511 INFO L375 BasicCegarLoop]: trace histogram [87, 45, 42, 1, 1, 1] [2018-10-04 14:25:01,511 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:01,511 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -648801205, now seen corresponding path program 41 times [2018-10-04 14:25:01,511 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:01,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:02,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:25:02,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:02,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 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 14:25:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:02,800 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 88 check-sat command(s) [2018-10-04 14:25:02,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:02,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:02,984 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 3827 proven. 1806 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:25:03,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:03,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-04 14:25:03,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-04 14:25:03,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-04 14:25:03,021 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:03,021 INFO L87 Difference]: Start difference. First operand 178 states and 223 transitions. Second operand 45 states. [2018-10-04 14:25:03,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:03,421 INFO L93 Difference]: Finished difference Result 273 states and 364 transitions. [2018-10-04 14:25:03,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 14:25:03,422 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 177 [2018-10-04 14:25:03,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:03,423 INFO L225 Difference]: With dead ends: 273 [2018-10-04 14:25:03,423 INFO L226 Difference]: Without dead ends: 180 [2018-10-04 14:25:03,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.9s impTime 43 [2018-10-04 14:25:03,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-04 14:25:03,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-10-04 14:25:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-04 14:25:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 225 transitions. [2018-10-04 14:25:03,431 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 225 transitions. Word has length 177 [2018-10-04 14:25:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:03,431 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 225 transitions. [2018-10-04 14:25:03,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-04 14:25:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 225 transitions. [2018-10-04 14:25:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-04 14:25:03,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:03,432 INFO L375 BasicCegarLoop]: trace histogram [88, 45, 43, 1, 1, 1] [2018-10-04 14:25:03,432 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:03,432 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:03,433 INFO L82 PathProgramCache]: Analyzing trace with hash 155747633, now seen corresponding path program 42 times [2018-10-04 14:25:03,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:03,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:03,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:03,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3916 proven. 1892 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2018-10-04 14:25:04,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:04,077 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 14:25:04,084 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:04,370 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 88 check-sat command(s) [2018-10-04 14:25:04,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:04,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 3913 proven. 2025 refuted. 0 times theorem prover too weak. 1806 trivial. 0 not checked. [2018-10-04 14:25:05,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:05,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 48] total 92 [2018-10-04 14:25:05,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 14:25:05,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 14:25:05,246 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:05,246 INFO L87 Difference]: Start difference. First operand 180 states and 225 transitions. Second operand 92 states. [2018-10-04 14:25:06,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:06,366 INFO L93 Difference]: Finished difference Result 278 states and 372 transitions. [2018-10-04 14:25:06,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-04 14:25:06,367 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 179 [2018-10-04 14:25:06,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:06,367 INFO L225 Difference]: With dead ends: 278 [2018-10-04 14:25:06,368 INFO L226 Difference]: Without dead ends: 185 [2018-10-04 14:25:06,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time 0.9s impTime 90 [2018-10-04 14:25:06,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-04 14:25:06,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-10-04 14:25:06,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-04 14:25:06,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 230 transitions. [2018-10-04 14:25:06,373 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 230 transitions. Word has length 179 [2018-10-04 14:25:06,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:06,374 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 230 transitions. [2018-10-04 14:25:06,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 14:25:06,374 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 230 transitions. [2018-10-04 14:25:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-04 14:25:06,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:06,375 INFO L375 BasicCegarLoop]: trace histogram [90, 46, 44, 1, 1, 1] [2018-10-04 14:25:06,375 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:06,375 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash 639671167, now seen corresponding path program 43 times [2018-10-04 14:25:06,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:06,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:06,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:06,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 14:25:07,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:07,361 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 14:25:07,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:07,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 4095 proven. 1980 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 14:25:07,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:07,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-04 14:25:07,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-04 14:25:07,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-04 14:25:07,778 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:07,778 INFO L87 Difference]: Start difference. First operand 184 states and 230 transitions. Second operand 47 states. [2018-10-04 14:25:07,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:07,960 INFO L93 Difference]: Finished difference Result 281 states and 374 transitions. [2018-10-04 14:25:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 14:25:07,961 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 183 [2018-10-04 14:25:07,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:07,962 INFO L225 Difference]: With dead ends: 281 [2018-10-04 14:25:07,962 INFO L226 Difference]: Without dead ends: 186 [2018-10-04 14:25:07,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time 0.7s impTime 45 [2018-10-04 14:25:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-04 14:25:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-10-04 14:25:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-04 14:25:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 232 transitions. [2018-10-04 14:25:07,967 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 232 transitions. Word has length 183 [2018-10-04 14:25:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:07,967 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 232 transitions. [2018-10-04 14:25:07,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-04 14:25:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 232 transitions. [2018-10-04 14:25:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-04 14:25:07,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:07,968 INFO L375 BasicCegarLoop]: trace histogram [91, 46, 45, 1, 1, 1] [2018-10-04 14:25:07,968 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:07,968 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash -807778331, now seen corresponding path program 44 times [2018-10-04 14:25:07,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:07,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 14:25:07,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 14:25:09,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:09,055 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 14:25:09,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 14:25:09,126 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 14:25:09,127 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:09,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:09,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 4186 proven. 2070 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 14:25:09,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:09,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-04 14:25:09,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 14:25:09,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 14:25:09,335 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:09,335 INFO L87 Difference]: Start difference. First operand 186 states and 232 transitions. Second operand 48 states. [2018-10-04 14:25:09,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:09,528 INFO L93 Difference]: Finished difference Result 283 states and 376 transitions. [2018-10-04 14:25:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 14:25:09,529 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 185 [2018-10-04 14:25:09,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:09,530 INFO L225 Difference]: With dead ends: 283 [2018-10-04 14:25:09,530 INFO L226 Difference]: Without dead ends: 188 [2018-10-04 14:25:09,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.9s impTime 46 [2018-10-04 14:25:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-04 14:25:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-10-04 14:25:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-04 14:25:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 234 transitions. [2018-10-04 14:25:09,536 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 234 transitions. Word has length 185 [2018-10-04 14:25:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:09,536 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 234 transitions. [2018-10-04 14:25:09,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 14:25:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 234 transitions. [2018-10-04 14:25:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-04 14:25:09,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:09,537 INFO L375 BasicCegarLoop]: trace histogram [92, 46, 46, 1, 1, 1] [2018-10-04 14:25:09,537 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:09,537 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:09,537 INFO L82 PathProgramCache]: Analyzing trace with hash -237342005, now seen corresponding path program 45 times [2018-10-04 14:25:09,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:09,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:09,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4277 proven. 2162 refuted. 0 times theorem prover too weak. 2025 trivial. 0 not checked. [2018-10-04 14:25:10,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:10,436 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 14:25:10,444 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 14:25:10,580 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-10-04 14:25:10,580 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:10,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:11,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:11,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 94] total 94 [2018-10-04 14:25:11,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-04 14:25:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-04 14:25:11,758 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:11,758 INFO L87 Difference]: Start difference. First operand 188 states and 234 transitions. Second operand 95 states. [2018-10-04 14:25:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:13,854 INFO L93 Difference]: Finished difference Result 291 states and 387 transitions. [2018-10-04 14:25:13,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-04 14:25:13,854 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2018-10-04 14:25:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:13,856 INFO L225 Difference]: With dead ends: 291 [2018-10-04 14:25:13,856 INFO L226 Difference]: Without dead ends: 196 [2018-10-04 14:25:13,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time 1.4s impTime 93 [2018-10-04 14:25:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-04 14:25:13,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-04 14:25:13,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-04 14:25:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2018-10-04 14:25:13,861 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 187 [2018-10-04 14:25:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:13,862 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2018-10-04 14:25:13,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-04 14:25:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2018-10-04 14:25:13,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-04 14:25:13,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:13,863 INFO L375 BasicCegarLoop]: trace histogram [96, 50, 46, 1, 1, 1] [2018-10-04 14:25:13,863 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:13,863 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:13,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1824288925, now seen corresponding path program 46 times [2018-10-04 14:25:13,864 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:13,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:13,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:13,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:13,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 4656 proven. 2304 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-10-04 14:25:14,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:14,846 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 14:25:14,853 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 14:25:14,916 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 14:25:14,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:14,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 14:25:16,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:16,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 98] total 101 [2018-10-04 14:25:16,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-04 14:25:16,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-04 14:25:16,933 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:16,933 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand 101 states. [2018-10-04 14:25:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:18,396 INFO L93 Difference]: Finished difference Result 205 states and 257 transitions. [2018-10-04 14:25:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-04 14:25:18,397 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 195 [2018-10-04 14:25:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:18,398 INFO L225 Difference]: With dead ends: 205 [2018-10-04 14:25:18,398 INFO L226 Difference]: Without dead ends: 203 [2018-10-04 14:25:18,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time 2.1s impTime 52 [2018-10-04 14:25:18,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-04 14:25:18,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-10-04 14:25:18,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 14:25:18,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 251 transitions. [2018-10-04 14:25:18,404 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 251 transitions. Word has length 195 [2018-10-04 14:25:18,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:18,404 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 251 transitions. [2018-10-04 14:25:18,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-04 14:25:18,404 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 251 transitions. [2018-10-04 14:25:18,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-04 14:25:18,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:18,406 INFO L375 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-10-04 14:25:18,406 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:18,406 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:18,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1260892901, now seen corresponding path program 47 times [2018-10-04 14:25:18,406 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:18,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:18,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:18,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:18,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 14:25:19,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:19,655 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 14:25:19,664 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 14:25:19,824 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 100 check-sat command(s) [2018-10-04 14:25:19,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:19,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:20,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-10-04 14:25:20,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:20,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:25:20,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:25:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:25:20,229 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:20,229 INFO L87 Difference]: Start difference. First operand 202 states and 251 transitions. Second operand 52 states. [2018-10-04 14:25:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:20,659 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2018-10-04 14:25:20,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:25:20,659 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 201 [2018-10-04 14:25:20,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:20,660 INFO L225 Difference]: With dead ends: 206 [2018-10-04 14:25:20,661 INFO L226 Difference]: Without dead ends: 204 [2018-10-04 14:25:20,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time 0.9s impTime 50 [2018-10-04 14:25:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-04 14:25:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-10-04 14:25:20,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-04 14:25:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 254 transitions. [2018-10-04 14:25:20,668 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 254 transitions. Word has length 201 [2018-10-04 14:25:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:20,669 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 254 transitions. [2018-10-04 14:25:20,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:25:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 254 transitions. [2018-10-04 14:25:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-04 14:25:20,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:20,671 INFO L375 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-10-04 14:25:20,671 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:20,671 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:20,672 INFO L82 PathProgramCache]: Analyzing trace with hash -537361661, now seen corresponding path program 48 times [2018-10-04 14:25:20,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:20,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:20,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:20,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:20,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 14:25:23,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 14:25:23,361 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 14:25:23,369 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 14:25:23,552 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 100 check-sat command(s) [2018-10-04 14:25:23,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 14:25:23,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 14:25:25,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 14:25:25,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 14:25:25,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-04 14:25:25,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-04 14:25:25,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-04 14:25:25,253 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:25,253 INFO L87 Difference]: Start difference. First operand 204 states and 254 transitions. Second operand 53 states. [2018-10-04 14:25:27,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:27,355 INFO L93 Difference]: Finished difference Result 2857 states and 4232 transitions. [2018-10-04 14:25:27,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 14:25:27,356 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-10-04 14:25:27,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:27,365 INFO L225 Difference]: With dead ends: 2857 [2018-10-04 14:25:27,365 INFO L226 Difference]: Without dead ends: 2855 [2018-10-04 14:25:27,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 201 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time 2.1s impTime 51 [2018-10-04 14:25:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2018-10-04 14:25:27,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 206. [2018-10-04 14:25:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-04 14:25:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 257 transitions. [2018-10-04 14:25:27,480 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 257 transitions. Word has length 203 [2018-10-04 14:25:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:27,480 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 257 transitions. [2018-10-04 14:25:27,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-04 14:25:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 257 transitions. [2018-10-04 14:25:27,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-04 14:25:27,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 14:25:27,482 INFO L375 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1] [2018-10-04 14:25:27,482 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 14:25:27,482 INFO L108 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 14:25:27,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1008541973, now seen corresponding path program 49 times [2018-10-04 14:25:27,482 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 14:25:27,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 14:25:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:27,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 14:25:27,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 14:25:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 14:25:28,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-10-04 14:25:28,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 14:25:28,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-10-04 14:25:28,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 14:25:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 14:25:28,122 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 14:25:28,122 INFO L87 Difference]: Start difference. First operand 206 states and 257 transitions. Second operand 52 states. [2018-10-04 14:25:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 14:25:28,743 INFO L93 Difference]: Finished difference Result 305 states and 405 transitions. [2018-10-04 14:25:28,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 14:25:28,743 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 205 [2018-10-04 14:25:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 14:25:28,744 INFO L225 Difference]: With dead ends: 305 [2018-10-04 14:25:28,745 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 14:25:28,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.4s impTime 50 [2018-10-04 14:25:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 14:25:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 14:25:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 14:25:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 14:25:28,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 205 [2018-10-04 14:25:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 14:25:28,747 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 14:25:28,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 14:25:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 14:25:28,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 14:25:28,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 14:25:29,800 WARN L178 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 1830 DAG size of output: 400 [2018-10-04 14:25:30,577 WARN L178 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 1835 DAG size of output: 410 [2018-10-04 14:25:33,365 WARN L178 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 400 DAG size of output: 351 [2018-10-04 14:25:35,140 WARN L178 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 410 DAG size of output: 357 [2018-10-04 14:25:35,145 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 44) no Hoare annotation was computed. [2018-10-04 14:25:35,145 INFO L421 ceAbstractionStarter]: At program point L30(lines 30 42) the Hoare annotation is: false [2018-10-04 14:25:35,145 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 44) no Hoare annotation was computed. [2018-10-04 14:25:35,145 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 44) no Hoare annotation was computed. [2018-10-04 14:25:35,145 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 43) no Hoare annotation was computed. [2018-10-04 14:25:35,146 INFO L421 ceAbstractionStarter]: At program point L22(lines 22 37) 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 (<= 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 (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4)) (<= 53 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 (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 (<= 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 (<= 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 (<= 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 (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 (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 (<= 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 (<= 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 14:25:35,147 INFO L421 ceAbstractionStarter]: At program point L41(lines 15 41) 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 (<= 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 (< 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 100)) (<= 100 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 (and (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4)) (<= 53 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 (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 (<= 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 (<= 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 (<= 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 (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 (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 (<= 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 (<= 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 14:25:35,177 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 02:25:35 BoogieIcfgContainer [2018-10-04 14:25:35,177 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 14:25:35,180 INFO L168 Benchmark]: Toolchain (without parser) took 83420.28 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 593.5 MB). Free memory was 1.5 GB in the beginning and 1.0 GB in the end (delta: 434.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:25:35,181 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.27 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 14:25:35,182 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.36 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 14:25:35,182 INFO L168 Benchmark]: Boogie Preprocessor took 17.86 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 14:25:35,182 INFO L168 Benchmark]: RCFGBuilder took 284.60 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 14:25:35,186 INFO L168 Benchmark]: TraceAbstraction took 83079.17 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 593.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 413.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-04 14:25:35,198 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.27 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 34.36 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 17.86 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 284.60 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 83079.17 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 593.5 MB). Free memory was 1.4 GB in the beginning and 1.0 GB in the end (delta: 413.7 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: 43]: 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: 22]: 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)) || (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)) || (((main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4) && 53 <= 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)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (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)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (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: 30]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 15]: 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)) || (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)) || ((99 < main_~y~4 && main_~y~4 <= 100) && 100 <= main_~x~4)) || (((main_~x~4 <= 82 && 82 <= main_~y~4) && main_~y~4 <= 82) && 82 <= main_~x~4)) || (((main_~x~4 <= 53 && main_~y~4 <= 53) && 53 <= main_~y~4) && 53 <= 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)) || (((74 <= main_~y~4 && main_~x~4 <= 74) && main_~y~4 <= 74) && 74 <= main_~x~4)) || (86 <= main_~x~4 && (86 <= main_~y~4 && main_~y~4 <= 86) && main_~x~4 <= 86)) || (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)) || (66 <= main_~x~4 && (66 <= main_~y~4 && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (70 <= main_~x~4 && (70 <= main_~y~4 && main_~x~4 <= 70) && main_~y~4 <= 70)) || (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, 7 locations, 1 error locations. SAFE Result, 82.9s OverallTime, 51 OverallIterations, 101 TraceHistogramMax, 18.1s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 292 SDtfs, 729 SDslu, 6043 SDs, 0 SdLazy, 7939 SolverSat, 1433 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6926 GetRequests, 5250 SyntacticMatches, 2 SemanticMatches, 1674 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=206occurred in iteration=50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 51 MinimizatonAttempts, 2660 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 204 NumberOfFragments, 1406 HoareAnnotationTreeSize, 3 FomulaSimplifications, 27582 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 3 FomulaSimplificationsInter, 404 FormulaSimplificationTreeSizeReductionInter, 4.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 50.5s InterpolantComputationTime, 11394 NumberOfCodeBlocks, 11320 NumberOfCodeBlocksAsserted, 1488 NumberOfCheckSat, 11294 ConstructedInterpolants, 0 QuantifiedInterpolants, 3709488 SizeOfPredicates, 14 NumberOfNonLiveVariables, 14405 ConjunctsInSsa, 1547 ConjunctsInUnsatCore, 100 InterpolantComputations, 3 PerfectInterpolantSequences, 295786/406427 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.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_14-25-35-224.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bplTransformedIcfg_BEv2_3.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_14-25-35-224.csv Received shutdown request...