java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:34:02,173 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:34:02,175 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:34:02,189 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:34:02,190 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:34:02,191 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:34:02,192 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:34:02,194 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:34:02,195 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:34:02,196 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:34:02,197 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:34:02,198 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:34:02,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:34:02,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:34:02,200 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:34:02,201 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:34:02,202 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:34:02,204 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:34:02,206 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:34:02,208 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:34:02,209 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:34:02,210 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:34:02,213 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:34:02,213 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:34:02,213 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:34:02,214 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:34:02,215 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:34:02,216 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:34:02,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:34:02,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:34:02,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:34:02,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:34:02,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:34:02,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:34:02,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:34:02,221 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:34:02,222 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:34:02,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:34:02,240 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:34:02,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:34:02,241 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:34:02,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:34:02,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:34:02,242 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:34:02,242 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:34:02,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:34:02,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:34:02,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:34:02,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:34:02,243 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:34:02,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:34:02,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:34:02,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:34:02,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:34:02,244 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:34:02,244 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:34:02,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:34:02,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:34:02,245 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:34:02,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:34:02,245 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:34:02,245 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:34:02,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:34:02,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:34:02,246 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:34:02,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:34:02,246 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:34:02,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:34:02,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:34:02,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:34:02,309 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:34:02,309 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:34:02,310 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-10-04 12:34:02,310 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-10-04 12:34:02,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:34:02,380 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:34:02,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:34:02,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:34:02,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:34:02,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:34:02,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:34:02,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:34:02,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:34:02,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... [2018-10-04 12:34:02,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:34:02,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:34:02,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:34:02,460 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:34:02,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:34:02,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:34:02,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:34:02,904 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:34:02,906 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:34:02 BoogieIcfgContainer [2018-10-04 12:34:02,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:34:02,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:34:02,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:34:02,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:34:02,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 12:34:02" (1/2) ... [2018-10-04 12:34:02,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc1ea2a and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:34:02, skipping insertion in model container [2018-10-04 12:34:02,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 12:34:02" (2/2) ... [2018-10-04 12:34:02,920 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-10-04 12:34:02,930 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:34:02,941 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-04 12:34:02,997 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:34:02,998 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:34:02,998 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:34:02,999 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:34:02,999 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:34:02,999 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:34:02,999 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:34:02,999 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:34:02,999 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:34:03,018 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-10-04 12:34:03,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 12:34:03,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,030 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 12:34:03,032 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:03,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,040 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-10-04 12:34:03,043 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:03,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:03,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:03,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:34:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:34:03,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:34:03,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:34:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:34:03,389 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-10-04 12:34:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,509 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-04 12:34:03,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:34:03,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 12:34:03,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,523 INFO L225 Difference]: With dead ends: 24 [2018-10-04 12:34:03,523 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 12:34:03,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:34:03,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 12:34:03,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-10-04 12:34:03,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 12:34:03,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-04 12:34:03,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-10-04 12:34:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:03,556 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-04 12:34:03,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:34:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 12:34:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 12:34:03,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,557 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 12:34:03,557 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:03,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,558 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-10-04 12:34:03,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:03,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:03,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:03,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:34:03,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:34:03,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:34:03,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:34:03,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:34:03,656 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-10-04 12:34:03,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,850 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-10-04 12:34:03,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 12:34:03,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 12:34:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,852 INFO L225 Difference]: With dead ends: 18 [2018-10-04 12:34:03,852 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 12:34:03,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:34:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 12:34:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-10-04 12:34:03,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:34:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-04 12:34:03,859 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-10-04 12:34:03,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:03,859 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-04 12:34:03,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:34:03,860 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-10-04 12:34:03,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 12:34:03,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,860 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:34:03,861 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:03,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,861 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-10-04 12:34:03,861 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:03,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:03,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:34:03,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:34:03,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:34:03,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:34:03,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:34:03,919 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-10-04 12:34:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:03,946 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-10-04 12:34:03,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:34:03,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-04 12:34:03,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:03,948 INFO L225 Difference]: With dead ends: 19 [2018-10-04 12:34:03,949 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 12:34:03,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:34:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 12:34:03,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 12:34:03,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 12:34:03,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 12:34:03,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-10-04 12:34:03,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:03,953 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 12:34:03,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:34:03,953 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 12:34:03,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 12:34:03,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:03,954 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 12:34:03,955 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:03,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:03,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-10-04 12:34:03,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:03,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:03,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:03,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:04,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:04,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:04,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:04,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:04,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:04,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:04,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:04,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 12:34:04,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 12:34:04,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 12:34:04,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-04 12:34:04,523 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-10-04 12:34:04,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:04,731 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 12:34:04,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 12:34:04,731 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-04 12:34:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:04,733 INFO L225 Difference]: With dead ends: 21 [2018-10-04 12:34:04,733 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 12:34:04,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 12:34:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-10-04 12:34:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 12:34:04,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 12:34:04,740 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-10-04 12:34:04,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:04,740 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 12:34:04,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 12:34:04,740 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 12:34:04,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 12:34:04,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:04,741 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-10-04 12:34:04,741 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:04,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:04,742 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-10-04 12:34:04,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:04,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:04,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:04,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:04,868 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:04,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:04,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:04,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:04,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:04,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:04,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:05,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:05,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:05,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:05,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:05,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 12:34:05,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 12:34:05,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 12:34:05,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-04 12:34:05,254 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-04 12:34:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:05,668 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 12:34:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 12:34:05,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-04 12:34:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:05,670 INFO L225 Difference]: With dead ends: 26 [2018-10-04 12:34:05,670 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 12:34:05,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-10-04 12:34:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 12:34:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 12:34:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 12:34:05,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 12:34:05,676 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-10-04 12:34:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:05,676 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 12:34:05,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 12:34:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 12:34:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 12:34:05,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:05,677 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-10-04 12:34:05,678 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:05,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-10-04 12:34:05,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:05,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:05,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:05,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:05,837 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:05,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:05,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 12:34:05,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:05,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:05,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:05,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:05,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:05,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:06,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:06,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 12:34:06,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 12:34:06,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 12:34:06,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-04 12:34:06,076 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-10-04 12:34:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:06,279 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 12:34:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:34:06,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-04 12:34:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:06,281 INFO L225 Difference]: With dead ends: 31 [2018-10-04 12:34:06,282 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 12:34:06,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:34:06,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 12:34:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-10-04 12:34:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 12:34:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 12:34:06,288 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-10-04 12:34:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:06,289 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 12:34:06,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 12:34:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 12:34:06,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 12:34:06,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:06,290 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-10-04 12:34:06,291 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:06,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:06,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-10-04 12:34:06,291 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:06,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:06,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:06,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:06,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:06,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:06,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:06,679 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:06,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:06,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:06,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:06,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:06,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:06,723 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:06,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:06,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 12:34:06,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 12:34:06,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 12:34:06,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-04 12:34:06,875 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-04 12:34:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:07,125 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 12:34:07,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 12:34:07,126 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-04 12:34:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:07,127 INFO L225 Difference]: With dead ends: 36 [2018-10-04 12:34:07,127 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 12:34:07,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-10-04 12:34:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 12:34:07,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-04 12:34:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 12:34:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 12:34:07,134 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-10-04 12:34:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:07,135 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 12:34:07,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 12:34:07,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 12:34:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 12:34:07,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:07,136 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-10-04 12:34:07,136 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:07,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:07,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-10-04 12:34:07,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:07,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:07,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:07,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:07,288 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:07,288 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:07,296 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:07,329 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 12:34:07,329 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:07,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:07,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:07,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:07,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:07,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:07,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:07,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 12:34:07,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 12:34:07,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 12:34:07,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-10-04 12:34:07,534 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-10-04 12:34:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:07,955 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 12:34:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 12:34:07,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-10-04 12:34:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:07,958 INFO L225 Difference]: With dead ends: 41 [2018-10-04 12:34:07,958 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 12:34:07,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:34:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 12:34:07,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-10-04 12:34:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 12:34:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 12:34:07,966 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-10-04 12:34:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:07,966 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 12:34:07,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 12:34:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 12:34:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:34:07,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:07,968 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-10-04 12:34:07,968 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:07,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:07,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-10-04 12:34:07,969 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:07,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:07,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:07,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:07,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:08,167 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:08,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:08,168 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:08,183 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:08,307 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 12:34:08,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:08,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:08,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:08,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:08,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:08,436 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:08,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:08,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 12:34:08,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 12:34:08,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 12:34:08,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-10-04 12:34:08,866 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-10-04 12:34:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:09,357 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 12:34:09,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 12:34:09,358 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-10-04 12:34:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:09,359 INFO L225 Difference]: With dead ends: 46 [2018-10-04 12:34:09,359 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 12:34:09,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=385, Unknown=0, NotChecked=0, Total=600 [2018-10-04 12:34:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 12:34:09,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-10-04 12:34:09,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 12:34:09,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 12:34:09,369 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-10-04 12:34:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:09,370 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 12:34:09,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 12:34:09,370 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 12:34:09,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:34:09,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:09,371 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-10-04 12:34:09,371 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:09,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:09,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-10-04 12:34:09,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:09,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:09,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:09,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:09,552 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:09,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:09,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:09,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:09,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:09,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:09,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:10,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:10,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 12:34:10,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 12:34:10,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 12:34:10,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-10-04 12:34:10,099 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-10-04 12:34:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:10,445 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 12:34:10,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 12:34:10,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-10-04 12:34:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:10,448 INFO L225 Difference]: With dead ends: 51 [2018-10-04 12:34:10,448 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 12:34:10,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:34:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 12:34:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-04 12:34:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 12:34:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 12:34:10,457 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-10-04 12:34:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:10,458 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 12:34:10,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 12:34:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 12:34:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 12:34:10,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:10,459 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-10-04 12:34:10,459 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:10,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-10-04 12:34:10,460 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:10,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:10,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:10,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:10,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:10,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:10,697 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:10,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:10,753 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:10,753 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:10,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:10,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:10,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:10,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:10,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:11,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:11,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 12:34:11,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 12:34:11,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 12:34:11,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-04 12:34:11,018 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-10-04 12:34:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:11,421 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 12:34:11,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 12:34:11,421 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-10-04 12:34:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:11,423 INFO L225 Difference]: With dead ends: 56 [2018-10-04 12:34:11,423 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 12:34:11,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-10-04 12:34:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 12:34:11,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-10-04 12:34:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 12:34:11,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 12:34:11,432 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-10-04 12:34:11,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:11,433 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 12:34:11,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 12:34:11,433 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 12:34:11,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 12:34:11,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:11,434 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-10-04 12:34:11,436 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:11,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:11,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-10-04 12:34:11,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:11,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:11,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:11,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:11,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:11,705 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:11,801 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 12:34:11,802 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:11,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:11,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:11,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:11,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:11,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:12,105 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:12,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:12,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 12:34:12,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 12:34:12,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 12:34:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-10-04 12:34:12,135 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-10-04 12:34:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:12,603 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 12:34:12,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 12:34:12,604 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-10-04 12:34:12,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:12,605 INFO L225 Difference]: With dead ends: 61 [2018-10-04 12:34:12,605 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 12:34:12,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:34:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 12:34:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-10-04 12:34:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:34:12,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 12:34:12,615 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-10-04 12:34:12,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:12,615 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 12:34:12,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 12:34:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 12:34:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 12:34:12,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:12,617 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-10-04 12:34:12,617 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:12,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:12,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-10-04 12:34:12,617 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:12,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:12,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:12,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:13,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:13,090 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:13,138 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:13,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:13,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:13,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:13,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:13,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:13,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:13,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:13,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 12:34:13,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 12:34:13,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 12:34:13,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-10-04 12:34:13,583 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-04 12:34:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:14,041 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 12:34:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 12:34:14,043 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-04 12:34:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:14,044 INFO L225 Difference]: With dead ends: 66 [2018-10-04 12:34:14,044 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 12:34:14,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=467, Invalid=865, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 12:34:14,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 12:34:14,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-04 12:34:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 12:34:14,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 12:34:14,055 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-10-04 12:34:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:14,056 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 12:34:14,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 12:34:14,056 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 12:34:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 12:34:14,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:14,057 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-10-04 12:34:14,057 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:14,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:14,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-10-04 12:34:14,058 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:14,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:14,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:14,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:14,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:14,412 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:14,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:14,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:14,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:14,494 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 12:34:14,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:14,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:14,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:14,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:14,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:14,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:14,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:14,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 12:34:14,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 12:34:14,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 12:34:14,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-10-04 12:34:14,797 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-10-04 12:34:15,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:15,308 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 12:34:15,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 12:34:15,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-10-04 12:34:15,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:15,310 INFO L225 Difference]: With dead ends: 71 [2018-10-04 12:34:15,310 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 12:34:15,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=545, Invalid=1015, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:34:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 12:34:15,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-04 12:34:15,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 12:34:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 12:34:15,323 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-10-04 12:34:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:15,323 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 12:34:15,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 12:34:15,324 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 12:34:15,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 12:34:15,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:15,325 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-10-04 12:34:15,325 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:15,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:15,325 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-10-04 12:34:15,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:15,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:15,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:15,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:15,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:16,098 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:16,106 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:16,167 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 12:34:16,167 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:16,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:16,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:16,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:16,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:16,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:16,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:16,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 12:34:16,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 12:34:16,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 12:34:16,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-10-04 12:34:16,462 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-10-04 12:34:16,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:16,969 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 12:34:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 12:34:16,970 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-10-04 12:34:16,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:16,970 INFO L225 Difference]: With dead ends: 76 [2018-10-04 12:34:16,971 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 12:34:16,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=629, Invalid=1177, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 12:34:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 12:34:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-04 12:34:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 12:34:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 12:34:16,984 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-10-04 12:34:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:16,984 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 12:34:16,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 12:34:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 12:34:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 12:34:16,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:16,985 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-10-04 12:34:16,986 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:16,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-10-04 12:34:16,986 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:16,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:16,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:17,797 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:17,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:17,798 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:17,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:17,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:17,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:17,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:17,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:17,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:18,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:18,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 12:34:18,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 12:34:18,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 12:34:18,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-10-04 12:34:18,192 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-10-04 12:34:19,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:19,042 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 12:34:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 12:34:19,042 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-10-04 12:34:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:19,043 INFO L225 Difference]: With dead ends: 81 [2018-10-04 12:34:19,043 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 12:34:19,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=719, Invalid=1351, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:34:19,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 12:34:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-10-04 12:34:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 12:34:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 12:34:19,055 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-10-04 12:34:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:19,055 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 12:34:19,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 12:34:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 12:34:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 12:34:19,056 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:19,056 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-10-04 12:34:19,057 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:19,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-10-04 12:34:19,057 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:19,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:19,866 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:19,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:19,867 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:19,875 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:19,927 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:19,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:19,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:19,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:19,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:19,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:19,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:20,277 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:20,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:20,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 12:34:20,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 12:34:20,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 12:34:20,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 12:34:20,300 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-10-04 12:34:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:20,880 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-04 12:34:20,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 12:34:20,881 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-10-04 12:34:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:20,882 INFO L225 Difference]: With dead ends: 86 [2018-10-04 12:34:20,882 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 12:34:20,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 12:34:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 12:34:20,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-10-04 12:34:20,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 12:34:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 12:34:20,893 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-10-04 12:34:20,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:20,894 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 12:34:20,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 12:34:20,894 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 12:34:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 12:34:20,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:20,894 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-10-04 12:34:20,895 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:20,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:20,895 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-10-04 12:34:20,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:20,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:20,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:20,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:20,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:21,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:21,564 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:21,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:21,655 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 12:34:21,655 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:21,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:21,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:21,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:21,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:21,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:22,112 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:22,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:22,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 12:34:22,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 12:34:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 12:34:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 12:34:22,135 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-10-04 12:34:22,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:22,711 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-04 12:34:22,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 12:34:22,711 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-10-04 12:34:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:22,712 INFO L225 Difference]: With dead ends: 91 [2018-10-04 12:34:22,712 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 12:34:22,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:34:22,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 12:34:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-10-04 12:34:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 12:34:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-04 12:34:22,728 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-10-04 12:34:22,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:22,728 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-04 12:34:22,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 12:34:22,728 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-04 12:34:22,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 12:34:22,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:22,729 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-10-04 12:34:22,729 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:22,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:22,730 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-10-04 12:34:22,730 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:22,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:22,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:22,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:23,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:23,255 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:23,262 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:23,328 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:23,328 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:23,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:23,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:23,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:23,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:23,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:24,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:24,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 12:34:24,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 12:34:24,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 12:34:24,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 12:34:24,006 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-10-04 12:34:24,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:24,615 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-04 12:34:24,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 12:34:24,615 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-10-04 12:34:24,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:24,616 INFO L225 Difference]: With dead ends: 96 [2018-10-04 12:34:24,616 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 12:34:24,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 12:34:24,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 12:34:24,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-04 12:34:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 12:34:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-04 12:34:24,627 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-10-04 12:34:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:24,627 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-04 12:34:24,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 12:34:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-04 12:34:24,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 12:34:24,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:24,628 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-10-04 12:34:24,629 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:24,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:24,629 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-10-04 12:34:24,629 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:24,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:24,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:24,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:24,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:24,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:24,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:24,974 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:25,058 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 12:34:25,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:25,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:25,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:25,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:25,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:25,075 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:25,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:25,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 12:34:25,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 12:34:25,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 12:34:25,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 12:34:25,472 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-10-04 12:34:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:26,094 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-04 12:34:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 12:34:26,095 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-10-04 12:34:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:26,096 INFO L225 Difference]: With dead ends: 101 [2018-10-04 12:34:26,096 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 12:34:26,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1139, Invalid=2167, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:34:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 12:34:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-10-04 12:34:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 12:34:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-04 12:34:26,109 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-10-04 12:34:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:26,109 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-04 12:34:26,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 12:34:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-04 12:34:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 12:34:26,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:26,110 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-10-04 12:34:26,111 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:26,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-10-04 12:34:26,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:26,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:26,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:26,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:26,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:26,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:26,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:26,534 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:26,744 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 12:34:26,744 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:26,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:26,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:26,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:26,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:26,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:27,130 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 12:34:27,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 12:34:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 12:34:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 12:34:27,152 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-10-04 12:34:27,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:27,885 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-04 12:34:27,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 12:34:27,886 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-10-04 12:34:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:27,886 INFO L225 Difference]: With dead ends: 106 [2018-10-04 12:34:27,886 INFO L226 Difference]: Without dead ends: 105 [2018-10-04 12:34:27,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1259, Invalid=2401, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 12:34:27,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-04 12:34:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-10-04 12:34:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-04 12:34:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-04 12:34:27,899 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-10-04 12:34:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:27,899 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-04 12:34:27,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 12:34:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-04 12:34:27,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-04 12:34:27,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:27,900 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-10-04 12:34:27,900 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:27,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-10-04 12:34:27,901 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:27,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:27,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:27,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:29,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:29,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:29,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:29,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:29,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:29,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:29,124 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:29,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:29,493 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:29,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:29,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 12:34:29,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 12:34:29,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 12:34:29,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 12:34:29,514 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-10-04 12:34:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:30,218 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-04 12:34:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 12:34:30,221 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-10-04 12:34:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:30,222 INFO L225 Difference]: With dead ends: 111 [2018-10-04 12:34:30,222 INFO L226 Difference]: Without dead ends: 110 [2018-10-04 12:34:30,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1385, Invalid=2647, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:34:30,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-04 12:34:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-10-04 12:34:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 12:34:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-04 12:34:30,236 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-10-04 12:34:30,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:30,236 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-04 12:34:30,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 12:34:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-04 12:34:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-04 12:34:30,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:30,237 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-10-04 12:34:30,237 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:30,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-10-04 12:34:30,237 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:30,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:30,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:30,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:30,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:30,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:30,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:30,748 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:30,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:30,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:30,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:30,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:30,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:30,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:32,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:32,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 12:34:32,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 12:34:32,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 12:34:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 12:34:32,659 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-10-04 12:34:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:33,493 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-04 12:34:33,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 12:34:33,493 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-10-04 12:34:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:33,494 INFO L225 Difference]: With dead ends: 116 [2018-10-04 12:34:33,495 INFO L226 Difference]: Without dead ends: 115 [2018-10-04 12:34:33,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1517, Invalid=2905, Unknown=0, NotChecked=0, Total=4422 [2018-10-04 12:34:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-04 12:34:33,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-10-04 12:34:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 12:34:33,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-04 12:34:33,513 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-10-04 12:34:33,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:33,514 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-04 12:34:33,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 12:34:33,514 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-04 12:34:33,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-04 12:34:33,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:33,515 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-10-04 12:34:33,515 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:33,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:33,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-10-04 12:34:33,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:33,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:33,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:34,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:34,199 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:34,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:34,326 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 12:34:34,326 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:34,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:34,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:34,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:34,444 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:34,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:35,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:35,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 12:34:35,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 12:34:35,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 12:34:35,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 12:34:35,014 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-10-04 12:34:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:35,920 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-04 12:34:35,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 12:34:35,921 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-10-04 12:34:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:35,922 INFO L225 Difference]: With dead ends: 121 [2018-10-04 12:34:35,922 INFO L226 Difference]: Without dead ends: 120 [2018-10-04 12:34:35,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1655, Invalid=3175, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:34:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-04 12:34:35,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-10-04 12:34:35,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 12:34:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-04 12:34:35,942 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-10-04 12:34:35,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:35,942 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-04 12:34:35,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 12:34:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-04 12:34:35,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-04 12:34:35,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:35,943 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-10-04 12:34:35,944 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:35,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:35,944 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-10-04 12:34:35,944 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:35,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:35,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:35,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:37,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:37,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:37,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:37,541 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:37,542 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:37,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:37,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:37,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:37,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:37,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:38,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:38,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 12:34:38,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 12:34:38,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 12:34:38,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 12:34:38,105 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-10-04 12:34:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:39,213 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-04 12:34:39,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 12:34:39,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-10-04 12:34:39,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:39,215 INFO L225 Difference]: With dead ends: 126 [2018-10-04 12:34:39,215 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 12:34:39,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1799, Invalid=3457, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 12:34:39,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 12:34:39,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-10-04 12:34:39,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-04 12:34:39,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-04 12:34:39,231 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-10-04 12:34:39,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:39,231 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-04 12:34:39,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 12:34:39,231 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-04 12:34:39,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-04 12:34:39,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:39,232 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-10-04 12:34:39,232 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:39,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:39,232 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-10-04 12:34:39,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:39,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:39,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:39,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:39,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:39,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:39,724 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:39,731 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:39,856 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 12:34:39,856 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:39,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:39,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:39,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:39,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:39,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:40,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:40,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 12:34:40,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 12:34:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 12:34:40,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 12:34:40,453 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-10-04 12:34:41,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:41,495 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-04 12:34:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 12:34:41,495 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-10-04 12:34:41,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:41,496 INFO L225 Difference]: With dead ends: 131 [2018-10-04 12:34:41,496 INFO L226 Difference]: Without dead ends: 130 [2018-10-04 12:34:41,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1949, Invalid=3751, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:34:41,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-04 12:34:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-04 12:34:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-04 12:34:41,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-04 12:34:41,513 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-10-04 12:34:41,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:41,513 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-04 12:34:41,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 12:34:41,513 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-04 12:34:41,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-04 12:34:41,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:41,514 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-10-04 12:34:41,514 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:41,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:41,514 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-10-04 12:34:41,514 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:41,514 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:41,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:41,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:41,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:42,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:42,737 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:42,745 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:34:42,880 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 12:34:42,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:42,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:42,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:42,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:42,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:42,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:43,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:43,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 12:34:43,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 12:34:43,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 12:34:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 12:34:43,459 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-10-04 12:34:44,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:44,637 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-04 12:34:44,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 12:34:44,637 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-10-04 12:34:44,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:44,638 INFO L225 Difference]: With dead ends: 136 [2018-10-04 12:34:44,639 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 12:34:44,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2105, Invalid=4057, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 12:34:44,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 12:34:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-10-04 12:34:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-04 12:34:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-04 12:34:44,659 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-10-04 12:34:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:44,660 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-04 12:34:44,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 12:34:44,660 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-04 12:34:44,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-04 12:34:44,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:44,661 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-10-04 12:34:44,661 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:44,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-10-04 12:34:44,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:44,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:44,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:44,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:45,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:45,199 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:45,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:45,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:45,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:45,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:45,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:45,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:45,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:45,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 12:34:45,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 12:34:45,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 12:34:45,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 12:34:45,991 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-10-04 12:34:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:47,072 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-04 12:34:47,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 12:34:47,073 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-10-04 12:34:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:47,074 INFO L225 Difference]: With dead ends: 141 [2018-10-04 12:34:47,074 INFO L226 Difference]: Without dead ends: 140 [2018-10-04 12:34:47,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2267, Invalid=4375, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:34:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-04 12:34:47,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-10-04 12:34:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-04 12:34:47,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-04 12:34:47,097 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-10-04 12:34:47,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:47,098 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-04 12:34:47,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 12:34:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-04 12:34:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 12:34:47,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:47,099 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-10-04 12:34:47,099 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:47,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:47,099 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-10-04 12:34:47,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:47,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:47,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:34:47,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:47,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:47,837 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:47,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:34:47,927 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:34:47,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:47,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:47,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:47,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:48,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:48,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:49,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:49,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:49,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 12:34:49,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 12:34:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 12:34:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 12:34:49,881 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-10-04 12:34:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:51,054 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-04 12:34:51,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 12:34:51,055 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-10-04 12:34:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:51,056 INFO L225 Difference]: With dead ends: 146 [2018-10-04 12:34:51,056 INFO L226 Difference]: Without dead ends: 145 [2018-10-04 12:34:51,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 12:34:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-04 12:34:51,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-10-04 12:34:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-04 12:34:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-04 12:34:51,082 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-10-04 12:34:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:51,083 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-04 12:34:51,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 12:34:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-04 12:34:51,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-04 12:34:51,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:51,084 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-10-04 12:34:51,084 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:51,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:51,085 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-10-04 12:34:51,085 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:51,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:51,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:51,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:51,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:51,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:51,707 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:51,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:34:51,867 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 12:34:51,867 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:51,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:51,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:51,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:51,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:51,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:52,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:52,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 12:34:52,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 12:34:52,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 12:34:52,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 12:34:52,679 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-10-04 12:34:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:53,876 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-04 12:34:53,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 12:34:53,877 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-10-04 12:34:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:53,878 INFO L225 Difference]: With dead ends: 151 [2018-10-04 12:34:53,878 INFO L226 Difference]: Without dead ends: 150 [2018-10-04 12:34:53,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:34:53,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-04 12:34:53,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-10-04 12:34:53,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 12:34:53,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-04 12:34:53,906 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-10-04 12:34:53,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:53,906 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-04 12:34:53,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 12:34:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-04 12:34:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-04 12:34:53,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:53,907 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-10-04 12:34:53,908 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:53,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:53,908 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-10-04 12:34:53,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:53,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:53,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:54,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:54,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:54,931 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:54,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:34:55,039 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:34:55,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:55,044 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:55,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:55,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:55,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:55,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:55,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:55,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:55,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 12:34:55,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 12:34:55,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 12:34:55,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 12:34:55,854 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-10-04 12:34:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:34:57,143 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-04 12:34:57,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 12:34:57,145 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-10-04 12:34:57,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:34:57,146 INFO L225 Difference]: With dead ends: 156 [2018-10-04 12:34:57,146 INFO L226 Difference]: Without dead ends: 155 [2018-10-04 12:34:57,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-10-04 12:34:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-04 12:34:57,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-04 12:34:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-04 12:34:57,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-04 12:34:57,175 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-10-04 12:34:57,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:34:57,176 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-04 12:34:57,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 12:34:57,176 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-04 12:34:57,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-04 12:34:57,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:34:57,177 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-10-04 12:34:57,177 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:34:57,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:34:57,178 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-10-04 12:34:57,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:34:57,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:34:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:57,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:34:57,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:34:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:34:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:57,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:34:57,960 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:34:57,969 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:34:58,122 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 12:34:58,122 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:34:58,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:34:58,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:34:58,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:34:58,224 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:34:58,225 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:34:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:34:59,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:34:59,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 12:34:59,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 12:34:59,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 12:34:59,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 12:34:59,242 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-10-04 12:35:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:00,672 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-04 12:35:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 12:35:00,673 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-10-04 12:35:00,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:00,674 INFO L225 Difference]: With dead ends: 161 [2018-10-04 12:35:00,674 INFO L226 Difference]: Without dead ends: 160 [2018-10-04 12:35:00,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:35:00,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-04 12:35:00,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-10-04 12:35:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-04 12:35:00,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-04 12:35:00,699 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-10-04 12:35:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:00,699 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-04 12:35:00,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 12:35:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-04 12:35:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-04 12:35:00,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:00,700 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-10-04 12:35:00,700 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:00,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-10-04 12:35:00,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:00,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:00,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:00,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:00,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:01,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:01,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:01,625 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:01,635 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:01,812 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 12:35:01,812 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:01,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:01,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:01,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:01,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:01,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:02,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:02,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:02,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 12:35:02,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 12:35:02,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 12:35:02,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 12:35:02,739 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-10-04 12:35:04,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:04,093 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-04 12:35:04,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 12:35:04,094 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-10-04 12:35:04,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:04,095 INFO L225 Difference]: With dead ends: 166 [2018-10-04 12:35:04,096 INFO L226 Difference]: Without dead ends: 165 [2018-10-04 12:35:04,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-10-04 12:35:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-04 12:35:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-10-04 12:35:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 12:35:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-04 12:35:04,129 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-10-04 12:35:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:04,129 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-04 12:35:04,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 12:35:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-04 12:35:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-04 12:35:04,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:04,130 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-10-04 12:35:04,131 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:04,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:04,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-10-04 12:35:04,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:04,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:04,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:04,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:04,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:05,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:05,275 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:05,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:05,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:05,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:05,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:05,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:05,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:06,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:06,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 12:35:06,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 12:35:06,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 12:35:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 12:35:06,309 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-10-04 12:35:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:07,972 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-04 12:35:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 12:35:07,972 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-10-04 12:35:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:07,974 INFO L225 Difference]: With dead ends: 171 [2018-10-04 12:35:07,974 INFO L226 Difference]: Without dead ends: 170 [2018-10-04 12:35:07,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 12:35:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-04 12:35:08,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-10-04 12:35:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 12:35:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-04 12:35:08,003 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-10-04 12:35:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:08,004 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-04 12:35:08,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 12:35:08,004 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-04 12:35:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-04 12:35:08,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:08,004 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-10-04 12:35:08,005 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:08,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:08,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-10-04 12:35:08,005 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:08,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:08,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:08,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:08,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:08,840 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:08,848 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:35:08,959 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:08,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:08,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:08,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:08,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:08,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:08,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:10,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:10,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 12:35:10,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 12:35:10,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 12:35:10,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 12:35:10,217 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-10-04 12:35:11,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:11,718 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-04 12:35:11,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 12:35:11,718 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-10-04 12:35:11,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:11,719 INFO L225 Difference]: With dead ends: 176 [2018-10-04 12:35:11,719 INFO L226 Difference]: Without dead ends: 175 [2018-10-04 12:35:11,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3569, Invalid=6937, Unknown=0, NotChecked=0, Total=10506 [2018-10-04 12:35:11,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-04 12:35:11,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-10-04 12:35:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-04 12:35:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-04 12:35:11,754 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-10-04 12:35:11,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:11,754 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-04 12:35:11,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 12:35:11,755 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-04 12:35:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-04 12:35:11,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:11,756 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-10-04 12:35:11,756 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:11,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:11,756 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-10-04 12:35:11,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:11,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:11,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:12,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:12,973 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:12,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:13,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 12:35:13,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:13,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:13,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:13,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:13,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:13,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:14,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:14,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:14,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 12:35:14,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 12:35:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 12:35:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 12:35:14,160 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-10-04 12:35:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:15,834 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-04 12:35:15,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 12:35:15,834 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-10-04 12:35:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:15,835 INFO L225 Difference]: With dead ends: 181 [2018-10-04 12:35:15,835 INFO L226 Difference]: Without dead ends: 180 [2018-10-04 12:35:15,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 12:35:15,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-04 12:35:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-10-04 12:35:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 12:35:15,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-04 12:35:15,868 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-10-04 12:35:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:15,868 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-04 12:35:15,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 12:35:15,868 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-04 12:35:15,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-04 12:35:15,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:15,869 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-10-04 12:35:15,869 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:15,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:15,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-10-04 12:35:15,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:15,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:15,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:15,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:15,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:17,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:17,047 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:17,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:17,181 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:17,182 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:17,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:17,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:17,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:17,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:17,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:18,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:18,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 12:35:18,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 12:35:18,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 12:35:18,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 12:35:18,267 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-10-04 12:35:19,019 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 12:35:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:20,669 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-04 12:35:20,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 12:35:20,670 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-10-04 12:35:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:20,671 INFO L225 Difference]: With dead ends: 186 [2018-10-04 12:35:20,671 INFO L226 Difference]: Without dead ends: 185 [2018-10-04 12:35:20,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3995, Invalid=7777, Unknown=0, NotChecked=0, Total=11772 [2018-10-04 12:35:20,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-04 12:35:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-04 12:35:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 12:35:20,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-04 12:35:20,701 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-10-04 12:35:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:20,701 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-04 12:35:20,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 12:35:20,702 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-04 12:35:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-04 12:35:20,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:20,703 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-10-04 12:35:20,703 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:20,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:20,703 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-10-04 12:35:20,703 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:20,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:22,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:22,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:22,012 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:22,019 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:22,213 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 12:35:22,214 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:22,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:22,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:22,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:22,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:22,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:23,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:23,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:23,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 12:35:23,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 12:35:23,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 12:35:23,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 12:35:23,458 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-10-04 12:35:25,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:25,327 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-04 12:35:25,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 12:35:25,327 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-10-04 12:35:25,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:25,328 INFO L225 Difference]: With dead ends: 191 [2018-10-04 12:35:25,328 INFO L226 Difference]: Without dead ends: 190 [2018-10-04 12:35:25,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 12:35:25,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-04 12:35:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-10-04 12:35:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 12:35:25,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-04 12:35:25,369 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-10-04 12:35:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:25,369 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-04 12:35:25,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 12:35:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-04 12:35:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-04 12:35:25,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:25,370 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-10-04 12:35:25,370 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:25,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-10-04 12:35:25,371 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:25,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:25,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:25,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:26,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:26,872 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:26,881 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:27,117 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 12:35:27,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:27,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:27,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:27,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:27,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:27,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:29,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:29,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 12:35:29,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 12:35:29,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 12:35:29,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 12:35:29,182 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-10-04 12:35:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:31,088 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-04 12:35:31,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 12:35:31,088 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-10-04 12:35:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:31,089 INFO L225 Difference]: With dead ends: 196 [2018-10-04 12:35:31,089 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 12:35:31,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-10-04 12:35:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 12:35:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-10-04 12:35:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-04 12:35:31,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-04 12:35:31,128 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-10-04 12:35:31,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:31,128 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-04 12:35:31,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 12:35:31,128 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-04 12:35:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-04 12:35:31,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:31,129 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-10-04 12:35:31,129 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:31,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:31,129 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-10-04 12:35:31,130 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:31,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:31,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:31,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:32,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:32,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:32,130 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:32,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:32,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:32,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:32,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:32,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:32,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:33,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:33,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 12:35:33,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 12:35:33,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 12:35:33,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 12:35:33,476 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-10-04 12:35:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:35,376 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-04 12:35:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 12:35:35,377 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-10-04 12:35:35,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:35,378 INFO L225 Difference]: With dead ends: 201 [2018-10-04 12:35:35,378 INFO L226 Difference]: Without dead ends: 200 [2018-10-04 12:35:35,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4679, Invalid=9127, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 12:35:35,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-04 12:35:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-10-04 12:35:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-04 12:35:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-04 12:35:35,421 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-10-04 12:35:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:35,421 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-04 12:35:35,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 12:35:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-04 12:35:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-04 12:35:35,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:35,422 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-10-04 12:35:35,422 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:35,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:35,422 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-10-04 12:35:35,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:35,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:35,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:35:35,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:36,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:36,391 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) [2018-10-04 12:35:36,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:36,534 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:35:36,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:36,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:36,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:36,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:36,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:36,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:37,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:37,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 12:35:37,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 12:35:37,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 12:35:37,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 12:35:37,791 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-10-04 12:35:39,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:39,882 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-04 12:35:39,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 12:35:39,882 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-10-04 12:35:39,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:39,883 INFO L225 Difference]: With dead ends: 206 [2018-10-04 12:35:39,883 INFO L226 Difference]: Without dead ends: 205 [2018-10-04 12:35:39,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-10-04 12:35:39,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-04 12:35:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-10-04 12:35:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 12:35:39,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-04 12:35:39,916 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-10-04 12:35:39,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:39,916 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-04 12:35:39,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 12:35:39,916 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-04 12:35:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-04 12:35:39,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:39,917 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-10-04 12:35:39,917 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:39,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:39,918 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-10-04 12:35:39,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:39,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:39,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:41,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:41,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:41,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:35:41,700 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 12:35:41,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:41,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:41,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:41,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:41,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:41,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:42,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:42,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 12:35:42,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 12:35:42,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 12:35:42,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 12:35:42,934 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-10-04 12:35:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:44,843 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-04 12:35:44,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 12:35:44,843 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-10-04 12:35:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:44,845 INFO L225 Difference]: With dead ends: 211 [2018-10-04 12:35:44,845 INFO L226 Difference]: Without dead ends: 210 [2018-10-04 12:35:44,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 12:35:44,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-04 12:35:44,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-10-04 12:35:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 12:35:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-04 12:35:44,880 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-10-04 12:35:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:44,881 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-04 12:35:44,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 12:35:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-04 12:35:44,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-04 12:35:44,882 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:44,882 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-10-04 12:35:44,882 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:44,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-10-04 12:35:44,882 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:44,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:44,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:44,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:46,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:46,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:46,412 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:46,422 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:35:46,601 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:35:46,601 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:46,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:46,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:46,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:46,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:46,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:47,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:47,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 12:35:47,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 12:35:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 12:35:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 12:35:47,998 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-10-04 12:35:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:50,027 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-04 12:35:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 12:35:50,027 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-10-04 12:35:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:50,028 INFO L225 Difference]: With dead ends: 216 [2018-10-04 12:35:50,028 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 12:35:50,029 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-10-04 12:35:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 12:35:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-10-04 12:35:50,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-04 12:35:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-04 12:35:50,070 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-10-04 12:35:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:50,070 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-04 12:35:50,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 12:35:50,070 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-04 12:35:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-04 12:35:50,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:50,071 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-10-04 12:35:50,071 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:50,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-10-04 12:35:50,072 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:50,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:50,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:50,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:50,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:51,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:51,651 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:51,659 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:35:51,901 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 12:35:51,901 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:51,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:51,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:51,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:51,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:51,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:53,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:53,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 12:35:53,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 12:35:53,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 12:35:53,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 12:35:53,342 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-10-04 12:35:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:35:55,487 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-04 12:35:55,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 12:35:55,487 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-10-04 12:35:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:35:55,488 INFO L225 Difference]: With dead ends: 221 [2018-10-04 12:35:55,488 INFO L226 Difference]: Without dead ends: 220 [2018-10-04 12:35:55,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-10-04 12:35:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-04 12:35:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-04 12:35:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-04 12:35:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-04 12:35:55,526 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-10-04 12:35:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:35:55,526 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-04 12:35:55,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 12:35:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-04 12:35:55,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-04 12:35:55,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:35:55,527 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-10-04 12:35:55,528 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:35:55,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:35:55,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-10-04 12:35:55,528 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:35:55,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:35:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:55,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:35:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:35:55,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:35:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:56,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:35:56,690 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:35:56,699 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:35:56,976 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 12:35:56,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:35:56,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:35:56,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:35:56,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:35:56,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:35:56,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:35:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:35:58,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:35:58,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-04 12:35:58,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 12:35:58,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 12:35:58,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 12:35:58,340 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-10-04 12:36:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:00,579 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-04 12:36:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 12:36:00,579 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-10-04 12:36:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:00,580 INFO L225 Difference]: With dead ends: 226 [2018-10-04 12:36:00,580 INFO L226 Difference]: Without dead ends: 225 [2018-10-04 12:36:00,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5939, Invalid=11617, Unknown=0, NotChecked=0, Total=17556 [2018-10-04 12:36:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-04 12:36:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-10-04 12:36:00,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-04 12:36:00,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-04 12:36:00,622 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-10-04 12:36:00,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:00,622 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-04 12:36:00,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 12:36:00,622 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-04 12:36:00,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-04 12:36:00,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:00,624 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-10-04 12:36:00,624 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:00,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:00,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-10-04 12:36:00,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:00,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:00,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:01,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:01,855 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:01,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:02,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:02,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:02,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:02,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:02,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:04,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:04,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-04 12:36:04,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 12:36:04,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 12:36:04,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 12:36:04,044 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-10-04 12:36:06,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:06,483 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-04 12:36:06,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 12:36:06,484 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-10-04 12:36:06,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:06,485 INFO L225 Difference]: With dead ends: 231 [2018-10-04 12:36:06,485 INFO L226 Difference]: Without dead ends: 230 [2018-10-04 12:36:06,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6209, Invalid=12151, Unknown=0, NotChecked=0, Total=18360 [2018-10-04 12:36:06,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-04 12:36:06,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-10-04 12:36:06,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 12:36:06,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-04 12:36:06,541 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-10-04 12:36:06,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:06,542 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-04 12:36:06,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 12:36:06,542 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-04 12:36:06,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-04 12:36:06,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:06,543 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-10-04 12:36:06,543 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:06,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-10-04 12:36:06,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:06,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:06,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:06,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:06,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:07,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:07,858 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:07,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:08,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:08,037 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:08,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:08,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:08,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:08,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:08,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:09,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:09,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:09,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-04 12:36:09,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 12:36:09,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 12:36:09,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 12:36:09,615 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-10-04 12:36:12,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:12,300 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-04 12:36:12,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 12:36:12,300 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-10-04 12:36:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:12,301 INFO L225 Difference]: With dead ends: 236 [2018-10-04 12:36:12,301 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 12:36:12,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6485, Invalid=12697, Unknown=0, NotChecked=0, Total=19182 [2018-10-04 12:36:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 12:36:12,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-10-04 12:36:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-04 12:36:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-04 12:36:12,355 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-10-04 12:36:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:12,355 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-04 12:36:12,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 12:36:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-04 12:36:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-04 12:36:12,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:12,356 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-10-04 12:36:12,357 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:12,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:12,357 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-10-04 12:36:12,357 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:12,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:12,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:13,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:13,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:13,743 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:13,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:14,057 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 12:36:14,057 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:14,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:14,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:14,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:14,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:14,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:15,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:15,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:15,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-04 12:36:15,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 12:36:15,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 12:36:15,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-10-04 12:36:15,888 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-10-04 12:36:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:18,718 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-04 12:36:18,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 12:36:18,718 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-10-04 12:36:18,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:18,719 INFO L225 Difference]: With dead ends: 241 [2018-10-04 12:36:18,719 INFO L226 Difference]: Without dead ends: 240 [2018-10-04 12:36:18,721 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6767, Invalid=13255, Unknown=0, NotChecked=0, Total=20022 [2018-10-04 12:36:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-04 12:36:18,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-10-04 12:36:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 12:36:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-04 12:36:18,780 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-10-04 12:36:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:18,780 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-04 12:36:18,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 12:36:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-04 12:36:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-04 12:36:18,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:18,781 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-10-04 12:36:18,782 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:18,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-10-04 12:36:18,782 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:18,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:18,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:18,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:20,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:20,220 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:20,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:36:20,388 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:36:20,389 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:20,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:20,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:20,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:20,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:20,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:22,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:22,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:22,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-04 12:36:22,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 12:36:22,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 12:36:22,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 12:36:22,335 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-10-04 12:36:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:25,068 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-04 12:36:25,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 12:36:25,069 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-10-04 12:36:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:25,070 INFO L225 Difference]: With dead ends: 246 [2018-10-04 12:36:25,070 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 12:36:25,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-10-04 12:36:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 12:36:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-10-04 12:36:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-04 12:36:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-04 12:36:25,120 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-10-04 12:36:25,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:25,121 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-04 12:36:25,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 12:36:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-04 12:36:25,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-04 12:36:25,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:25,122 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-10-04 12:36:25,122 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:25,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:25,122 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-10-04 12:36:25,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:25,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:25,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:25,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:26,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:26,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:26,825 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:26,832 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:36:27,108 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 12:36:27,108 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:27,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:27,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:27,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:27,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:27,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:28,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:28,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:28,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-04 12:36:28,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 12:36:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 12:36:28,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 12:36:28,878 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-10-04 12:36:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:31,674 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-04 12:36:31,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 12:36:31,675 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-10-04 12:36:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:31,676 INFO L225 Difference]: With dead ends: 251 [2018-10-04 12:36:31,676 INFO L226 Difference]: Without dead ends: 250 [2018-10-04 12:36:31,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-10-04 12:36:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-04 12:36:31,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-10-04 12:36:31,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-04 12:36:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-04 12:36:31,731 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-10-04 12:36:31,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:31,731 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-04 12:36:31,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 12:36:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-04 12:36:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-04 12:36:31,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:31,733 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-10-04 12:36:31,733 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:31,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:31,733 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-10-04 12:36:31,733 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:31,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:31,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:31,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:31,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:33,116 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:33,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:33,116 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:33,124 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:36:33,470 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 12:36:33,470 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:33,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:33,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:33,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:33,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:33,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:35,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:35,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-04 12:36:35,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 12:36:35,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 12:36:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-10-04 12:36:35,396 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-10-04 12:36:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:38,364 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-04 12:36:38,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 12:36:38,364 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-10-04 12:36:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:38,365 INFO L225 Difference]: With dead ends: 256 [2018-10-04 12:36:38,366 INFO L226 Difference]: Without dead ends: 255 [2018-10-04 12:36:38,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-10-04 12:36:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-04 12:36:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-10-04 12:36:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-04 12:36:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-04 12:36:38,428 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-10-04 12:36:38,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:38,428 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-04 12:36:38,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 12:36:38,428 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-04 12:36:38,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-04 12:36:38,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:38,430 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-10-04 12:36:38,430 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:38,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:38,431 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-10-04 12:36:38,431 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:38,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:38,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:38,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:38,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:39,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:39,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:39,847 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:39,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:40,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:40,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:40,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:40,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:40,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:42,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:42,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-04 12:36:42,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 12:36:42,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 12:36:42,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-10-04 12:36:42,279 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-10-04 12:36:45,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:45,101 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-04 12:36:45,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 12:36:45,101 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-10-04 12:36:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:45,103 INFO L225 Difference]: With dead ends: 261 [2018-10-04 12:36:45,103 INFO L226 Difference]: Without dead ends: 260 [2018-10-04 12:36:45,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-10-04 12:36:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-04 12:36:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-10-04 12:36:45,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-04 12:36:45,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-04 12:36:45,174 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-10-04 12:36:45,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:45,175 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-04 12:36:45,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 12:36:45,175 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-04 12:36:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-04 12:36:45,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:45,176 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-10-04 12:36:45,176 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:45,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-10-04 12:36:45,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:45,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:45,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:36:45,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:46,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:46,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:46,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:36:46,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:36:46,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:46,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:47,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:47,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:47,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:47,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:49,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:49,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-10-04 12:36:49,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 12:36:49,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 12:36:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 12:36:49,002 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-10-04 12:36:52,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:52,141 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-04 12:36:52,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 12:36:52,141 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-10-04 12:36:52,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:52,143 INFO L225 Difference]: With dead ends: 266 [2018-10-04 12:36:52,143 INFO L226 Difference]: Without dead ends: 265 [2018-10-04 12:36:52,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-10-04 12:36:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-04 12:36:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-10-04 12:36:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-04 12:36:52,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-04 12:36:52,199 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-10-04 12:36:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:52,200 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-04 12:36:52,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 12:36:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-04 12:36:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-04 12:36:52,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:52,201 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-10-04 12:36:52,201 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:52,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:52,201 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-10-04 12:36:52,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:52,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:52,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:52,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:52,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:36:53,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:53,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:36:53,821 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:36:53,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:36:54,271 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 12:36:54,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:36:54,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:36:54,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:36:54,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:36:54,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:36:54,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:36:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:36:56,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:36:56,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-10-04 12:36:56,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 12:36:56,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 12:36:56,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-10-04 12:36:56,218 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-10-04 12:36:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:36:59,530 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-04 12:36:59,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 12:36:59,530 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-10-04 12:36:59,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:36:59,531 INFO L225 Difference]: With dead ends: 271 [2018-10-04 12:36:59,532 INFO L226 Difference]: Without dead ends: 270 [2018-10-04 12:36:59,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8585, Invalid=16855, Unknown=0, NotChecked=0, Total=25440 [2018-10-04 12:36:59,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-04 12:36:59,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-10-04 12:36:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-04 12:36:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-04 12:36:59,591 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-10-04 12:36:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:36:59,591 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-04 12:36:59,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 12:36:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-04 12:36:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-04 12:36:59,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:36:59,592 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-10-04 12:36:59,593 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:36:59,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:36:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-10-04 12:36:59,593 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:36:59,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:36:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:59,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:36:59,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:36:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:01,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:01,138 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:01,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:37:01,324 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:37:01,324 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:01,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:01,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:01,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:01,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:01,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:03,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:03,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-10-04 12:37:03,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 12:37:03,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 12:37:03,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 12:37:03,509 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-10-04 12:37:06,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:06,463 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-04 12:37:06,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 12:37:06,464 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-10-04 12:37:06,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:06,465 INFO L225 Difference]: With dead ends: 276 [2018-10-04 12:37:06,465 INFO L226 Difference]: Without dead ends: 275 [2018-10-04 12:37:06,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8909, Invalid=17497, Unknown=0, NotChecked=0, Total=26406 [2018-10-04 12:37:06,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-04 12:37:06,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-04 12:37:06,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-04 12:37:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-04 12:37:06,534 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-10-04 12:37:06,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:06,535 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-04 12:37:06,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 12:37:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-04 12:37:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-04 12:37:06,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:06,536 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-10-04 12:37:06,536 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:06,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-10-04 12:37:06,537 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:06,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:06,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:06,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:06,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:08,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:08,443 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:08,451 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:37:08,795 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 12:37:08,795 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:08,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:08,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:08,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:08,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:08,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:10,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:10,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-10-04 12:37:10,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 12:37:10,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 12:37:10,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 12:37:10,791 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-10-04 12:37:14,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:14,066 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-04 12:37:14,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 12:37:14,066 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-10-04 12:37:14,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:14,068 INFO L225 Difference]: With dead ends: 281 [2018-10-04 12:37:14,068 INFO L226 Difference]: Without dead ends: 280 [2018-10-04 12:37:14,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9239, Invalid=18151, Unknown=0, NotChecked=0, Total=27390 [2018-10-04 12:37:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-04 12:37:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-10-04 12:37:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-04 12:37:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-04 12:37:14,151 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-10-04 12:37:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:14,151 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-04 12:37:14,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 12:37:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-04 12:37:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-04 12:37:14,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:14,153 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-10-04 12:37:14,153 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:14,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:14,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-10-04 12:37:14,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:14,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:14,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:14,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:14,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:15,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:15,871 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:15,879 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 12:37:16,298 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 12:37:16,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:16,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:16,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:16,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:16,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:16,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:18,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:18,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:18,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-10-04 12:37:18,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-04 12:37:18,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-04 12:37:18,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 12:37:18,591 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-10-04 12:37:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:21,741 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-04 12:37:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 12:37:21,742 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-10-04 12:37:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:21,743 INFO L225 Difference]: With dead ends: 286 [2018-10-04 12:37:21,743 INFO L226 Difference]: Without dead ends: 285 [2018-10-04 12:37:21,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9575, Invalid=18817, Unknown=0, NotChecked=0, Total=28392 [2018-10-04 12:37:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-04 12:37:21,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-10-04 12:37:21,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-04 12:37:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-04 12:37:21,803 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-10-04 12:37:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:21,804 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-04 12:37:21,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-04 12:37:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-04 12:37:21,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-04 12:37:21,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:21,805 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-10-04 12:37:21,805 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:21,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:21,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-10-04 12:37:21,805 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:21,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:21,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:21,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:21,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:23,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:23,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:23,566 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:23,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:23,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:23,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:23,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:23,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:23,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:25,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:25,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:25,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-10-04 12:37:25,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-04 12:37:25,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-04 12:37:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 12:37:25,868 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-10-04 12:37:29,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:29,120 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-04 12:37:29,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 12:37:29,121 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-10-04 12:37:29,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:29,122 INFO L225 Difference]: With dead ends: 291 [2018-10-04 12:37:29,122 INFO L226 Difference]: Without dead ends: 290 [2018-10-04 12:37:29,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-10-04 12:37:29,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-04 12:37:29,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-10-04 12:37:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-04 12:37:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-04 12:37:29,198 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-10-04 12:37:29,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:29,198 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-04 12:37:29,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-04 12:37:29,198 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-04 12:37:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-04 12:37:29,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:29,199 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-10-04 12:37:29,199 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:29,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-10-04 12:37:29,200 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:29,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:29,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:37:29,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:31,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:31,076 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:31,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 12:37:31,266 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 12:37:31,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:31,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:31,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:31,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:31,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:31,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:33,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:33,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-10-04 12:37:33,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-04 12:37:33,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-04 12:37:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 12:37:33,515 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-10-04 12:37:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:36,729 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-04 12:37:36,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 12:37:36,729 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-10-04 12:37:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:36,730 INFO L225 Difference]: With dead ends: 296 [2018-10-04 12:37:36,730 INFO L226 Difference]: Without dead ends: 295 [2018-10-04 12:37:36,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-10-04 12:37:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-04 12:37:36,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-10-04 12:37:36,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-04 12:37:36,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-04 12:37:36,798 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-10-04 12:37:36,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:36,799 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-04 12:37:36,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-04 12:37:36,799 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-04 12:37:36,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-04 12:37:36,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:36,800 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-10-04 12:37:36,800 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:36,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:36,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-10-04 12:37:36,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:36,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:36,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:36,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:38,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:38,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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:38,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 12:37:39,101 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 12:37:39,102 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:39,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:39,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:39,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:39,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:39,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:41,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:41,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-10-04 12:37:41,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-04 12:37:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-04 12:37:41,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-10-04 12:37:41,361 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-10-04 12:37:44,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:44,775 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-04 12:37:44,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 12:37:44,775 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-10-04 12:37:44,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:44,777 INFO L225 Difference]: With dead ends: 301 [2018-10-04 12:37:44,777 INFO L226 Difference]: Without dead ends: 300 [2018-10-04 12:37:44,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-10-04 12:37:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-04 12:37:44,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-10-04 12:37:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-04 12:37:44,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-04 12:37:44,850 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-10-04 12:37:44,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:44,851 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-04 12:37:44,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-04 12:37:44,851 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-04 12:37:44,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-04 12:37:44,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:44,852 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-10-04 12:37:44,852 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:44,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:44,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-10-04 12:37:44,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:44,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:44,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:44,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:44,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:46,697 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:46,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:46,698 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:46,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 12:37:46,917 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 12:37:46,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:46,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:46,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:46,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:46,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:46,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:49,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:49,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:49,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-10-04 12:37:49,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-04 12:37:49,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-04 12:37:49,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 12:37:49,309 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-10-04 12:37:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:37:52,666 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-04 12:37:52,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 12:37:52,667 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-10-04 12:37:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:37:52,668 INFO L225 Difference]: With dead ends: 306 [2018-10-04 12:37:52,668 INFO L226 Difference]: Without dead ends: 305 [2018-10-04 12:37:52,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-10-04 12:37:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-04 12:37:52,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-10-04 12:37:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-04 12:37:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-04 12:37:52,749 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-10-04 12:37:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:37:52,749 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-04 12:37:52,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-04 12:37:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-04 12:37:52,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-04 12:37:52,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:37:52,750 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-10-04 12:37:52,751 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:37:52,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:37:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-10-04 12:37:52,751 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:37:52,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:37:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:52,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:37:52,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:37:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:37:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:54,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:37:54,678 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:37:54,684 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 12:37:55,093 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 12:37:55,093 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 12:37:55,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:37:55,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 12:37:55,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 12:37:55,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 12:37:55,118 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 12:37:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 12:37:57,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:37:57,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-10-04 12:37:57,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-04 12:37:57,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-04 12:37:57,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 12:37:57,535 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2018-10-04 12:38:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:38:01,117 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-04 12:38:01,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 12:38:01,124 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2018-10-04 12:38:01,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:38:01,125 INFO L225 Difference]: With dead ends: 311 [2018-10-04 12:38:01,125 INFO L226 Difference]: Without dead ends: 310 [2018-10-04 12:38:01,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11345, Invalid=22327, Unknown=0, NotChecked=0, Total=33672 [2018-10-04 12:38:01,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-04 12:38:01,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2018-10-04 12:38:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 12:38:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-04 12:38:01,202 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2018-10-04 12:38:01,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:38:01,202 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-04 12:38:01,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-04 12:38:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-04 12:38:01,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-04 12:38:01,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:38:01,204 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2018-10-04 12:38:01,204 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 12:38:01,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:38:01,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2018-10-04 12:38:01,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:38:01,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:38:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:01,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 12:38:01,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:38:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-10-04 12:38:01,698 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 12:38:01,703 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 12:38:01,703 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 12:38:01 BoogieIcfgContainer [2018-10-04 12:38:01,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:38:01,704 INFO L168 Benchmark]: Toolchain (without parser) took 239325.87 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: -819.5 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-04 12:38:01,705 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:38:01,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:38:01,706 INFO L168 Benchmark]: Boogie Preprocessor took 22.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:38:01,706 INFO L168 Benchmark]: RCFGBuilder took 446.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-04 12:38:01,706 INFO L168 Benchmark]: TraceAbstraction took 238796.27 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -840.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-04 12:38:01,708 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.20 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 55.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 446.16 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 238796.27 ms. Allocated memory was 1.5 GB in the beginning and 3.8 GB in the end (delta: 2.3 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -840.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 307 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - TimeoutResultAtElement [Line: 58]: Timeout (TraceAbstraction) Unable to prove that procedure precondition always holds and assertion always holds (line 58). Cancelled while BasicCegarLoop was analyzing trace of length 307 with TraceHistMax 61, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 27 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. TIMEOUT Result, 238.7s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 97.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 11200 SDslu, 2208 SDs, 0 SdLazy, 16368 SolverSat, 5613 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12932 GetRequests, 7320 SyntacticMatches, 0 SemanticMatches, 5612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221132 ImplicationChecksByTransitivity, 179.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=307occurred in iteration=62, 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: 1.9s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.6s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 122.3s InterpolantComputationTime, 18428 NumberOfCodeBlocks, 18428 NumberOfCodeBlocksAsserted, 1031 NumberOfCheckSat, 18307 ConstructedInterpolants, 0 QuantifiedInterpolants, 29560497 SizeOfPredicates, 639 NumberOfNonLiveVariables, 39471 ConjunctsInSsa, 6411 ConjunctsInUnsatCore, 121 InterpolantComputations, 3 PerfectInterpolantSequences, 2/356362 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-38-01-716.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-38-01-716.csv Completed graceful shutdown