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-133090d [2018-10-04 09:28:04,346 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:28:04,347 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:28:04,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:28:04,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:28:04,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:28:04,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:28:04,364 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:28:04,365 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:28:04,366 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:28:04,367 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:28:04,367 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:28:04,368 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:28:04,369 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:28:04,370 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:28:04,371 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:28:04,372 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:28:04,374 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:28:04,376 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:28:04,377 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:28:04,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:28:04,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:28:04,386 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:28:04,386 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:28:04,386 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:28:04,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:28:04,388 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:28:04,389 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:28:04,390 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:28:04,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:28:04,394 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:28:04,395 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:28:04,395 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:28:04,395 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:28:04,396 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:28:04,397 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:28:04,397 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 09:28:04,425 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:28:04,426 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:28:04,426 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:28:04,427 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:28:04,427 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:28:04,427 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:28:04,428 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:28:04,428 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:28:04,428 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:28:04,428 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:28:04,429 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:28:04,429 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:28:04,429 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:28:04,429 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:28:04,429 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:28:04,430 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:28:04,430 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:28:04,430 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:28:04,430 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:28:04,430 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:28:04,431 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:28:04,431 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:28:04,431 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:28:04,431 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:28:04,431 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:28:04,432 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:28:04,432 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:28:04,432 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:28:04,432 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:28:04,432 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:28:04,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:28:04,496 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:28:04,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:28:04,505 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:28:04,506 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:28:04,507 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 09:28:04,507 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-10-04 09:28:04,587 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:28:04,588 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:28:04,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:28:04,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:28:04,590 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:28:04,608 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 09:28:04" (1/1) ... [2018-10-04 09:28:04,626 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 09:28:04" (1/1) ... [2018-10-04 09:28:04,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:28:04,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:28:04,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:28:04,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:28:04,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/1) ... [2018-10-04 09:28:04,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/1) ... [2018-10-04 09:28:04,671 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/1) ... [2018-10-04 09:28:04,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/1) ... [2018-10-04 09:28:04,675 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/1) ... [2018-10-04 09:28:04,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/1) ... [2018-10-04 09:28:04,683 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/1) ... [2018-10-04 09:28:04,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:28:04,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:28:04,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:28:04,686 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:28:04,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (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 09:28:04,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:28:04,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:28:05,019 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:28:05,020 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:28:05 BoogieIcfgContainer [2018-10-04 09:28:05,020 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:28:05,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:28:05,022 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:28:05,025 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:28:05,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:28:04" (1/2) ... [2018-10-04 09:28:05,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@236fde90 and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:28:05, skipping insertion in model container [2018-10-04 09:28:05,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:28:05" (2/2) ... [2018-10-04 09:28:05,028 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-10-04 09:28:05,038 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:28:05,055 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-10-04 09:28:05,146 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:28:05,147 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:28:05,147 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:28:05,148 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:28:05,148 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:28:05,148 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:28:05,148 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:28:05,149 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:28:05,149 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:28:05,165 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2018-10-04 09:28:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-04 09:28:05,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:05,173 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-10-04 09:28:05,176 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:05,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:05,183 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2018-10-04 09:28:05,185 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:05,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:05,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:05,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:05,420 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 09:28:05,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:28:05,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:28:05,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:28:05,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:28:05,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:28:05,441 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2018-10-04 09:28:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:05,559 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-10-04 09:28:05,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:28:05,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-10-04 09:28:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:05,573 INFO L225 Difference]: With dead ends: 24 [2018-10-04 09:28:05,573 INFO L226 Difference]: Without dead ends: 11 [2018-10-04 09:28:05,577 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 09:28:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-04 09:28:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2018-10-04 09:28:05,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-04 09:28:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-10-04 09:28:05,608 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2018-10-04 09:28:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:05,608 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-10-04 09:28:05,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:28:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-10-04 09:28:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-04 09:28:05,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:05,609 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-10-04 09:28:05,610 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:05,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2018-10-04 09:28:05,610 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:05,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:05,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:05,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:05,863 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 09:28:05,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:28:05,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:28:05,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:28:05,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:28:05,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 09:28:05,867 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2018-10-04 09:28:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:06,084 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-10-04 09:28:06,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-04 09:28:06,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-04 09:28:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:06,088 INFO L225 Difference]: With dead ends: 18 [2018-10-04 09:28:06,088 INFO L226 Difference]: Without dead ends: 17 [2018-10-04 09:28:06,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 09:28:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-04 09:28:06,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-10-04 09:28:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:28:06,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-10-04 09:28:06,095 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2018-10-04 09:28:06,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:06,095 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-10-04 09:28:06,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:28:06,095 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-10-04 09:28:06,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-04 09:28:06,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:06,096 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:28:06,097 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:06,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:06,097 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2018-10-04 09:28:06,097 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:06,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:06,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:06,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:06,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:06,135 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 09:28:06,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:28:06,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:28:06,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:28:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:28:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 09:28:06,137 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2018-10-04 09:28:06,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:06,154 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-10-04 09:28:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:28:06,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-10-04 09:28:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:06,157 INFO L225 Difference]: With dead ends: 19 [2018-10-04 09:28:06,157 INFO L226 Difference]: Without dead ends: 12 [2018-10-04 09:28:06,158 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 09:28:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-04 09:28:06,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-04 09:28:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-04 09:28:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-04 09:28:06,162 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-10-04 09:28:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:06,162 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-04 09:28:06,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:28:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-04 09:28:06,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-04 09:28:06,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:06,163 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2018-10-04 09:28:06,164 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:06,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:06,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2018-10-04 09:28:06,164 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:06,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:06,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:06,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:06,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:06,394 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 09:28:06,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:06,395 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 09:28:06,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:06,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:06,507 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 09:28:06,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:06,593 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 09:28:06,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:06,680 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 09:28:06,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:06,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-10-04 09:28:06,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-04 09:28:06,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-04 09:28:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-10-04 09:28:06,703 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2018-10-04 09:28:06,876 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-04 09:28:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:07,054 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-04 09:28:07,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-04 09:28:07,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2018-10-04 09:28:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:07,056 INFO L225 Difference]: With dead ends: 21 [2018-10-04 09:28:07,057 INFO L226 Difference]: Without dead ends: 20 [2018-10-04 09:28:07,057 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 09:28:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-04 09:28:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2018-10-04 09:28:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-04 09:28:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-04 09:28:07,063 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2018-10-04 09:28:07,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:07,064 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-04 09:28:07,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-04 09:28:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-04 09:28:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-04 09:28:07,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:07,065 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2018-10-04 09:28:07,065 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:07,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2018-10-04 09:28:07,066 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:07,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:07,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:07,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:07,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:07,208 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 09:28:07,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:07,209 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 09:28:07,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:28:07,245 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:28:07,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:07,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:07,257 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 09:28:07,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:07,268 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 09:28:07,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:07,522 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 09:28:07,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:07,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-10-04 09:28:07,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-04 09:28:07,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-04 09:28:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-10-04 09:28:07,562 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-10-04 09:28:07,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:07,978 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-04 09:28:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-04 09:28:07,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-10-04 09:28:07,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:07,980 INFO L225 Difference]: With dead ends: 26 [2018-10-04 09:28:07,980 INFO L226 Difference]: Without dead ends: 25 [2018-10-04 09:28:07,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2018-10-04 09:28:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-04 09:28:07,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-04 09:28:07,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-04 09:28:07,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-04 09:28:07,988 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2018-10-04 09:28:07,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:07,988 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-04 09:28:07,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-04 09:28:07,988 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-04 09:28:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-04 09:28:07,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:07,989 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2018-10-04 09:28:07,990 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:07,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:07,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2018-10-04 09:28:07,991 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:07,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:07,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:07,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:08,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:08,202 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 09:28:08,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:08,203 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 09:28:08,218 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:28:08,247 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-04 09:28:08,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:08,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:08,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:28:08,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:08,282 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 09:28:08,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:08,382 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 09:28:08,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:08,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-10-04 09:28:08,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-04 09:28:08,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-04 09:28:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-10-04 09:28:08,404 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-10-04 09:28:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:08,652 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-04 09:28:08,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:28:08,654 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-10-04 09:28:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:08,655 INFO L225 Difference]: With dead ends: 31 [2018-10-04 09:28:08,655 INFO L226 Difference]: Without dead ends: 30 [2018-10-04 09:28:08,656 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 09:28:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-04 09:28:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-10-04 09:28:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-04 09:28:08,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-04 09:28:08,662 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2018-10-04 09:28:08,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:08,663 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-04 09:28:08,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-04 09:28:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-04 09:28:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-04 09:28:08,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:08,664 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2018-10-04 09:28:08,664 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:08,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:08,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2018-10-04 09:28:08,665 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:08,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:08,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:08,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:08,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:08,863 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 09:28:08,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:08,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:28:08,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:28:08,920 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:28:08,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:08,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:08,935 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 09:28:08,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:08,991 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 09:28:08,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:09,112 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 09:28:09,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:09,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-10-04 09:28:09,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-04 09:28:09,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-04 09:28:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-10-04 09:28:09,134 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-04 09:28:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:09,376 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-04 09:28:09,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-04 09:28:09,376 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-04 09:28:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:09,378 INFO L225 Difference]: With dead ends: 36 [2018-10-04 09:28:09,378 INFO L226 Difference]: Without dead ends: 35 [2018-10-04 09:28:09,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2018-10-04 09:28:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-04 09:28:09,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-04 09:28:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-04 09:28:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-04 09:28:09,387 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2018-10-04 09:28:09,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:09,387 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-04 09:28:09,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-04 09:28:09,387 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-04 09:28:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-04 09:28:09,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:09,388 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2018-10-04 09:28:09,389 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:09,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2018-10-04 09:28:09,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:09,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:09,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:09,696 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 09:28:09,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:09,696 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 09:28:09,704 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:28:09,741 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-04 09:28:09,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:09,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:09,756 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 09:28:09,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:09,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 09:28:09,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:09,952 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 09:28:09,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:09,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-10-04 09:28:09,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-04 09:28:09,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-04 09:28:09,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2018-10-04 09:28:09,974 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2018-10-04 09:28:10,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:10,384 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-04 09:28:10,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-04 09:28:10,385 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2018-10-04 09:28:10,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:10,387 INFO L225 Difference]: With dead ends: 41 [2018-10-04 09:28:10,387 INFO L226 Difference]: Without dead ends: 40 [2018-10-04 09:28:10,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:28:10,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-04 09:28:10,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-10-04 09:28:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-04 09:28:10,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-04 09:28:10,395 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2018-10-04 09:28:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:10,396 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-04 09:28:10,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-04 09:28:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-04 09:28:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:28:10,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:10,397 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2018-10-04 09:28:10,397 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:10,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:10,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2018-10-04 09:28:10,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:10,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:10,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:10,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:10,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:10,795 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 09:28:10,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:10,796 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 09:28:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:28:10,892 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-04 09:28:10,892 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:10,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:10,916 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 09:28:10,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:10,935 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 09:28:10,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:11,073 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 09:28:11,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:11,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-10-04 09:28:11,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-04 09:28:11,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-04 09:28:11,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2018-10-04 09:28:11,097 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2018-10-04 09:28:11,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:11,496 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-04 09:28:11,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-04 09:28:11,498 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-10-04 09:28:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:11,499 INFO L225 Difference]: With dead ends: 46 [2018-10-04 09:28:11,499 INFO L226 Difference]: Without dead ends: 45 [2018-10-04 09:28:11,500 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 09:28:11,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-04 09:28:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-10-04 09:28:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-04 09:28:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-04 09:28:11,510 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2018-10-04 09:28:11,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:11,511 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-04 09:28:11,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-04 09:28:11,511 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-04 09:28:11,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:28:11,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:11,512 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2018-10-04 09:28:11,513 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:11,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:11,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2018-10-04 09:28:11,513 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:11,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:11,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:11,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:11,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:11,743 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 09:28:11,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:11,744 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 09:28:11,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:11,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:11,833 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 09:28:11,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:11,840 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 09:28:11,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:12,072 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 09:28:12,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:12,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2018-10-04 09:28:12,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-04 09:28:12,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-04 09:28:12,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2018-10-04 09:28:12,095 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2018-10-04 09:28:12,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:12,440 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-04 09:28:12,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-04 09:28:12,440 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-10-04 09:28:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:12,441 INFO L225 Difference]: With dead ends: 51 [2018-10-04 09:28:12,441 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 09:28:12,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=269, Invalid=487, Unknown=0, NotChecked=0, Total=756 [2018-10-04 09:28:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 09:28:12,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-10-04 09:28:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-04 09:28:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-04 09:28:12,450 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2018-10-04 09:28:12,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:12,450 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-04 09:28:12,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-04 09:28:12,450 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-04 09:28:12,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-04 09:28:12,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:12,451 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2018-10-04 09:28:12,452 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:12,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2018-10-04 09:28:12,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:12,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:12,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:12,652 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 09:28:12,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:12,653 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 09:28:12,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:28:12,719 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:28:12,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:12,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:12,733 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 09:28:12,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:12,743 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 09:28:12,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:13,208 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 09:28:13,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:13,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-10-04 09:28:13,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-04 09:28:13,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-04 09:28:13,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2018-10-04 09:28:13,235 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2018-10-04 09:28:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:13,728 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-04 09:28:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-04 09:28:13,728 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-10-04 09:28:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:13,729 INFO L225 Difference]: With dead ends: 56 [2018-10-04 09:28:13,729 INFO L226 Difference]: Without dead ends: 55 [2018-10-04 09:28:13,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=601, Unknown=0, NotChecked=0, Total=930 [2018-10-04 09:28:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-04 09:28:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2018-10-04 09:28:13,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-04 09:28:13,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-04 09:28:13,741 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2018-10-04 09:28:13,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:13,741 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-04 09:28:13,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-04 09:28:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-04 09:28:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-04 09:28:13,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:13,743 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2018-10-04 09:28:13,743 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:13,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2018-10-04 09:28:13,744 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:13,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:13,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:13,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:13,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:14,120 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 09:28:14,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:14,120 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 09:28:14,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:28:14,183 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-04 09:28:14,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:14,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:14,193 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 09:28:14,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:14,207 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 09:28:14,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:14,440 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 09:28:14,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:14,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2018-10-04 09:28:14,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-04 09:28:14,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-04 09:28:14,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2018-10-04 09:28:14,472 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2018-10-04 09:28:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:15,109 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-04 09:28:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-04 09:28:15,109 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2018-10-04 09:28:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:15,110 INFO L225 Difference]: With dead ends: 61 [2018-10-04 09:28:15,110 INFO L226 Difference]: Without dead ends: 60 [2018-10-04 09:28:15,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=395, Invalid=727, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 09:28:15,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-04 09:28:15,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-10-04 09:28:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:28:15,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-04 09:28:15,120 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2018-10-04 09:28:15,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:15,121 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-04 09:28:15,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-04 09:28:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-04 09:28:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-04 09:28:15,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:15,122 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2018-10-04 09:28:15,123 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:15,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2018-10-04 09:28:15,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:15,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:15,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:15,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:15,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:16,001 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 09:28:16,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:16,001 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 09:28:16,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:28:16,056 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:28:16,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:16,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:16,070 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 09:28:16,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:16,081 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 09:28:16,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:16,376 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 09:28:16,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:16,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-10-04 09:28:16,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-04 09:28:16,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-04 09:28:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2018-10-04 09:28:16,398 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-04 09:28:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:16,940 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-04 09:28:16,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-04 09:28:16,941 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-04 09:28:16,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:16,942 INFO L225 Difference]: With dead ends: 66 [2018-10-04 09:28:16,942 INFO L226 Difference]: Without dead ends: 65 [2018-10-04 09:28:16,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=467, Invalid=865, Unknown=0, NotChecked=0, Total=1332 [2018-10-04 09:28:16,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-04 09:28:16,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-04 09:28:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-04 09:28:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-04 09:28:16,953 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2018-10-04 09:28:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:16,954 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-04 09:28:16,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-04 09:28:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-04 09:28:16,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-04 09:28:16,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:16,955 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2018-10-04 09:28:16,955 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:16,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2018-10-04 09:28:16,956 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:16,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:16,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:16,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:16,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:17,315 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 09:28:17,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:17,316 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 09:28:17,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:28:17,401 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-04 09:28:17,401 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:17,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:17,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:28:17,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:17,437 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 09:28:17,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:17,679 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 09:28:17,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:17,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2018-10-04 09:28:17,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-04 09:28:17,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-04 09:28:17,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2018-10-04 09:28:17,702 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2018-10-04 09:28:18,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:18,211 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-04 09:28:18,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-04 09:28:18,211 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-10-04 09:28:18,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:18,212 INFO L225 Difference]: With dead ends: 71 [2018-10-04 09:28:18,212 INFO L226 Difference]: Without dead ends: 70 [2018-10-04 09:28:18,213 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 09:28:18,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-04 09:28:18,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-04 09:28:18,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-04 09:28:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-04 09:28:18,225 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2018-10-04 09:28:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:18,226 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-04 09:28:18,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-04 09:28:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-04 09:28:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-04 09:28:18,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:18,227 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2018-10-04 09:28:18,227 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:18,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:18,228 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2018-10-04 09:28:18,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:18,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:18,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:18,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:18,484 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 09:28:18,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:18,484 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:28:18,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:28:18,558 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-04 09:28:18,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:18,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:18,582 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 09:28:18,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:18,609 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 09:28:18,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:18,904 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 09:28:18,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:18,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-10-04 09:28:18,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-04 09:28:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-04 09:28:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2018-10-04 09:28:18,926 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2018-10-04 09:28:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:19,453 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-04 09:28:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-04 09:28:19,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2018-10-04 09:28:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:19,455 INFO L225 Difference]: With dead ends: 76 [2018-10-04 09:28:19,455 INFO L226 Difference]: Without dead ends: 75 [2018-10-04 09:28:19,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=629, Invalid=1177, Unknown=0, NotChecked=0, Total=1806 [2018-10-04 09:28:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-04 09:28:19,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2018-10-04 09:28:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-04 09:28:19,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-04 09:28:19,469 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2018-10-04 09:28:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:19,469 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-04 09:28:19,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-04 09:28:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-04 09:28:19,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 09:28:19,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:19,471 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2018-10-04 09:28:19,471 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:19,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2018-10-04 09:28:19,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:19,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:19,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:19,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:19,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:19,914 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 09:28:19,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:19,915 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 09:28:19,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:19,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:20,007 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 09:28:20,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:20,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:28:20,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:20,345 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 09:28:20,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:20,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2018-10-04 09:28:20,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-04 09:28:20,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-04 09:28:20,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2018-10-04 09:28:20,367 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2018-10-04 09:28:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:21,027 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-04 09:28:21,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-04 09:28:21,028 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-10-04 09:28:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:21,029 INFO L225 Difference]: With dead ends: 81 [2018-10-04 09:28:21,029 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 09:28:21,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=719, Invalid=1351, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 09:28:21,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 09:28:21,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2018-10-04 09:28:21,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-04 09:28:21,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-04 09:28:21,041 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2018-10-04 09:28:21,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:21,042 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-04 09:28:21,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-04 09:28:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-04 09:28:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-04 09:28:21,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:21,043 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2018-10-04 09:28:21,043 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:21,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:21,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2018-10-04 09:28:21,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:21,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:21,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:21,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:21,479 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 09:28:21,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:21,479 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 09:28:21,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:28:21,548 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:28:21,548 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:21,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:21,556 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 09:28:21,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:21,565 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 09:28:21,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:21,895 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 09:28:21,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:21,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 33 [2018-10-04 09:28:21,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-04 09:28:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-04 09:28:21,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2018-10-04 09:28:21,917 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2018-10-04 09:28:22,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:22,435 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-04 09:28:22,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-04 09:28:22,438 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2018-10-04 09:28:22,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:22,439 INFO L225 Difference]: With dead ends: 86 [2018-10-04 09:28:22,439 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:28:22,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=815, Invalid=1537, Unknown=0, NotChecked=0, Total=2352 [2018-10-04 09:28:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:28:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-10-04 09:28:22,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-04 09:28:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-04 09:28:22,450 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2018-10-04 09:28:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:22,450 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-04 09:28:22,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-04 09:28:22,451 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-04 09:28:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-04 09:28:22,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:22,451 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2018-10-04 09:28:22,451 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:22,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2018-10-04 09:28:22,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:22,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:22,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:22,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:22,868 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 09:28:22,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:22,869 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 09:28:22,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:28:22,976 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-04 09:28:22,976 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:22,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:23,002 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 09:28:23,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:23,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:28:23,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:23,594 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 09:28:23,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:23,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2018-10-04 09:28:23,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-04 09:28:23,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-04 09:28:23,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2018-10-04 09:28:23,617 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2018-10-04 09:28:24,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:24,346 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-04 09:28:24,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-04 09:28:24,346 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2018-10-04 09:28:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:24,347 INFO L225 Difference]: With dead ends: 91 [2018-10-04 09:28:24,347 INFO L226 Difference]: Without dead ends: 90 [2018-10-04 09:28:24,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=917, Invalid=1735, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 09:28:24,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-04 09:28:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-10-04 09:28:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-04 09:28:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-04 09:28:24,361 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2018-10-04 09:28:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:24,361 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-04 09:28:24,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-04 09:28:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-04 09:28:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 09:28:24,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:24,362 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2018-10-04 09:28:24,362 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:24,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:24,363 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2018-10-04 09:28:24,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:24,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:24,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:24,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:24,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:25,262 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 09:28:25,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:25,262 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 09:28:25,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:28:25,330 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:28:25,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:25,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:25,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:28:25,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:25,347 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 09:28:25,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:25,704 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 09:28:25,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:25,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-10-04 09:28:25,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-04 09:28:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-04 09:28:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2018-10-04 09:28:25,726 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2018-10-04 09:28:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:26,330 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-04 09:28:26,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-04 09:28:26,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2018-10-04 09:28:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:26,331 INFO L225 Difference]: With dead ends: 96 [2018-10-04 09:28:26,331 INFO L226 Difference]: Without dead ends: 95 [2018-10-04 09:28:26,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1025, Invalid=1945, Unknown=0, NotChecked=0, Total=2970 [2018-10-04 09:28:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-04 09:28:26,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-04 09:28:26,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-04 09:28:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-04 09:28:26,343 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2018-10-04 09:28:26,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:26,343 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-04 09:28:26,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-04 09:28:26,343 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-04 09:28:26,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-04 09:28:26,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:26,344 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2018-10-04 09:28:26,344 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:26,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:26,345 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2018-10-04 09:28:26,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:26,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:26,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:26,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:26,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:26,671 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 09:28:26,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:26,671 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:28:26,680 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:28:26,764 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-04 09:28:26,764 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:26,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:26,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 09:28:26,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:26,779 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 09:28:26,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:27,125 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 09:28:27,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:27,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-04 09:28:27,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-04 09:28:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-04 09:28:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2018-10-04 09:28:27,147 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2018-10-04 09:28:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:27,743 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-04 09:28:27,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-04 09:28:27,743 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2018-10-04 09:28:27,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:27,744 INFO L225 Difference]: With dead ends: 101 [2018-10-04 09:28:27,744 INFO L226 Difference]: Without dead ends: 100 [2018-10-04 09:28:27,746 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 09:28:27,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-04 09:28:27,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-10-04 09:28:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-04 09:28:27,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-04 09:28:27,755 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2018-10-04 09:28:27,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:27,756 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-04 09:28:27,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-04 09:28:27,756 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-04 09:28:27,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 09:28:27,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:27,757 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2018-10-04 09:28:27,757 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:27,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:27,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2018-10-04 09:28:27,757 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:27,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:27,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:27,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:27,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:28,149 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 09:28:28,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:28,150 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 09:28:28,157 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:28:28,405 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-04 09:28:28,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:28,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:28,419 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 09:28:28,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:28,430 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 09:28:28,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:28,836 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 09:28:28,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:28,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-10-04 09:28:28,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-04 09:28:28,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-04 09:28:28,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2018-10-04 09:28:28,858 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2018-10-04 09:28:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:29,728 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-04 09:28:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-04 09:28:29,728 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2018-10-04 09:28:29,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:29,730 INFO L225 Difference]: With dead ends: 106 [2018-10-04 09:28:29,730 INFO L226 Difference]: Without dead ends: 105 [2018-10-04 09:28:29,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1259, Invalid=2401, Unknown=0, NotChecked=0, Total=3660 [2018-10-04 09:28:29,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-04 09:28:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-10-04 09:28:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-04 09:28:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-04 09:28:29,744 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2018-10-04 09:28:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:29,744 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-04 09:28:29,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-04 09:28:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-04 09:28:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-04 09:28:29,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:29,745 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2018-10-04 09:28:29,746 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:29,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:29,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2018-10-04 09:28:29,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:29,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:29,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:29,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:30,887 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 09:28:30,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:30,887 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 09:28:30,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:30,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:31,009 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 09:28:31,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:31,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:28:31,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:31,406 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 09:28:31,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:31,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 43 [2018-10-04 09:28:31,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-04 09:28:31,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-04 09:28:31,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2018-10-04 09:28:31,429 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2018-10-04 09:28:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:32,117 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-04 09:28:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-04 09:28:32,120 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2018-10-04 09:28:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:32,121 INFO L225 Difference]: With dead ends: 111 [2018-10-04 09:28:32,121 INFO L226 Difference]: Without dead ends: 110 [2018-10-04 09:28:32,123 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 09:28:32,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-04 09:28:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2018-10-04 09:28:32,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-04 09:28:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-04 09:28:32,135 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2018-10-04 09:28:32,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:32,136 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-04 09:28:32,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-04 09:28:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-04 09:28:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-04 09:28:32,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:32,137 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2018-10-04 09:28:32,137 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:32,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2018-10-04 09:28:32,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:32,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:32,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:32,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:32,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:32,531 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 09:28:32,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:32,531 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:28:32,539 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:28:32,624 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:28:32,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:32,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:32,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:28:32,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:32,712 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 09:28:32,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:34,667 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 09:28:34,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:34,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 45 [2018-10-04 09:28:34,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-04 09:28:34,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-04 09:28:34,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2018-10-04 09:28:34,689 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2018-10-04 09:28:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:35,442 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-04 09:28:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-04 09:28:35,443 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2018-10-04 09:28:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:35,444 INFO L225 Difference]: With dead ends: 116 [2018-10-04 09:28:35,444 INFO L226 Difference]: Without dead ends: 115 [2018-10-04 09:28:35,446 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 09:28:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-04 09:28:35,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2018-10-04 09:28:35,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-04 09:28:35,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-04 09:28:35,459 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2018-10-04 09:28:35,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:35,459 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-04 09:28:35,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-04 09:28:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-04 09:28:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-04 09:28:35,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:35,460 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2018-10-04 09:28:35,461 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:35,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2018-10-04 09:28:35,461 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:35,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:35,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:36,069 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 09:28:36,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:36,070 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 09:28:36,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:28:36,195 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-04 09:28:36,195 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:36,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:36,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:28:36,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:36,314 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 09:28:36,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:36,822 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 09:28:36,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:36,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2018-10-04 09:28:36,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-04 09:28:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-04 09:28:36,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2018-10-04 09:28:36,845 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2018-10-04 09:28:37,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:37,756 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-04 09:28:37,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-04 09:28:37,757 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2018-10-04 09:28:37,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:37,757 INFO L225 Difference]: With dead ends: 121 [2018-10-04 09:28:37,758 INFO L226 Difference]: Without dead ends: 120 [2018-10-04 09:28:37,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1655, Invalid=3175, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 09:28:37,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-04 09:28:37,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-10-04 09:28:37,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-04 09:28:37,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-04 09:28:37,775 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2018-10-04 09:28:37,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:37,775 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-04 09:28:37,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-04 09:28:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-04 09:28:37,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-04 09:28:37,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:37,776 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2018-10-04 09:28:37,777 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:37,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2018-10-04 09:28:37,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:37,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:37,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:38,415 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 09:28:38,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:38,416 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 09:28:38,423 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:28:38,504 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:28:38,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:38,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:38,515 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 09:28:38,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:38,533 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 09:28:38,533 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:39,037 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 09:28:39,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:39,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 49 [2018-10-04 09:28:39,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-04 09:28:39,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-04 09:28:39,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2018-10-04 09:28:39,059 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2018-10-04 09:28:40,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:40,200 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-04 09:28:40,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-04 09:28:40,200 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2018-10-04 09:28:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:40,201 INFO L225 Difference]: With dead ends: 126 [2018-10-04 09:28:40,202 INFO L226 Difference]: Without dead ends: 125 [2018-10-04 09:28:40,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1799, Invalid=3457, Unknown=0, NotChecked=0, Total=5256 [2018-10-04 09:28:40,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-04 09:28:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-10-04 09:28:40,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-04 09:28:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-04 09:28:40,218 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2018-10-04 09:28:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:40,218 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-04 09:28:40,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-04 09:28:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-04 09:28:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-04 09:28:40,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:40,219 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2018-10-04 09:28:40,219 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:40,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:40,219 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2018-10-04 09:28:40,219 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:40,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:40,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:40,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:40,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:40,747 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 09:28:40,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:40,747 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 09:28:40,755 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:28:40,874 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-04 09:28:40,875 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:40,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:40,885 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 09:28:40,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:40,894 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 09:28:40,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:41,485 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 09:28:41,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:41,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-10-04 09:28:41,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-04 09:28:41,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-04 09:28:41,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2018-10-04 09:28:41,507 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2018-10-04 09:28:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:42,562 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-04 09:28:42,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-04 09:28:42,563 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2018-10-04 09:28:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:42,564 INFO L225 Difference]: With dead ends: 131 [2018-10-04 09:28:42,564 INFO L226 Difference]: Without dead ends: 130 [2018-10-04 09:28:42,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1949, Invalid=3751, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 09:28:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-04 09:28:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-04 09:28:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-04 09:28:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-04 09:28:42,583 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2018-10-04 09:28:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:42,584 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-04 09:28:42,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-04 09:28:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-04 09:28:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-04 09:28:42,584 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:42,585 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2018-10-04 09:28:42,585 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:42,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2018-10-04 09:28:42,585 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:42,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:42,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:43,164 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 09:28:43,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:43,164 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 09:28:43,172 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:28:43,307 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-04 09:28:43,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:43,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:43,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 09:28:43,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:43,344 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 09:28:43,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:43,854 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 09:28:43,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:43,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2018-10-04 09:28:43,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-04 09:28:43,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-04 09:28:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2018-10-04 09:28:43,876 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2018-10-04 09:28:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:45,055 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-04 09:28:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-04 09:28:45,055 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2018-10-04 09:28:45,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:45,056 INFO L225 Difference]: With dead ends: 136 [2018-10-04 09:28:45,056 INFO L226 Difference]: Without dead ends: 135 [2018-10-04 09:28:45,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2105, Invalid=4057, Unknown=0, NotChecked=0, Total=6162 [2018-10-04 09:28:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-04 09:28:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2018-10-04 09:28:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-04 09:28:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-04 09:28:45,079 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2018-10-04 09:28:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:45,079 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-04 09:28:45,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-04 09:28:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-04 09:28:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-04 09:28:45,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:45,080 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2018-10-04 09:28:45,080 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:45,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:45,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2018-10-04 09:28:45,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:45,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:45,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:45,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:45,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:45,731 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 09:28:45,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:45,732 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 09:28:45,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:45,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:45,854 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 09:28:45,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:45,863 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 09:28:45,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:46,512 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 09:28:46,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:46,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 55 [2018-10-04 09:28:46,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-04 09:28:46,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-04 09:28:46,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1136, Invalid=1944, Unknown=0, NotChecked=0, Total=3080 [2018-10-04 09:28:46,534 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2018-10-04 09:28:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:47,583 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-04 09:28:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-04 09:28:47,583 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2018-10-04 09:28:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:47,584 INFO L225 Difference]: With dead ends: 141 [2018-10-04 09:28:47,584 INFO L226 Difference]: Without dead ends: 140 [2018-10-04 09:28:47,585 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 09:28:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-04 09:28:47,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2018-10-04 09:28:47,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-04 09:28:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-04 09:28:47,608 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2018-10-04 09:28:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:47,609 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-04 09:28:47,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-04 09:28:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-04 09:28:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 09:28:47,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:47,610 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2018-10-04 09:28:47,610 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:47,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:47,611 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2018-10-04 09:28:47,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:47,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:47,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:47,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:28:47,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:49,135 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 09:28:49,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:49,136 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:28:49,144 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:28:49,231 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:28:49,231 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:49,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:49,256 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 09:28:49,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:49,343 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 09:28:49,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:50,869 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 09:28:50,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:50,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 57 [2018-10-04 09:28:50,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-04 09:28:50,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-04 09:28:50,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1220, Invalid=2086, Unknown=0, NotChecked=0, Total=3306 [2018-10-04 09:28:50,891 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2018-10-04 09:28:51,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:51,964 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-04 09:28:51,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-04 09:28:51,965 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2018-10-04 09:28:51,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:51,966 INFO L225 Difference]: With dead ends: 146 [2018-10-04 09:28:51,966 INFO L226 Difference]: Without dead ends: 145 [2018-10-04 09:28:51,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2435, Invalid=4705, Unknown=0, NotChecked=0, Total=7140 [2018-10-04 09:28:51,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-04 09:28:51,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-10-04 09:28:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-04 09:28:51,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-04 09:28:51,993 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2018-10-04 09:28:51,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:51,993 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-04 09:28:51,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-04 09:28:51,994 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-04 09:28:51,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-04 09:28:51,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:51,995 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2018-10-04 09:28:51,995 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:51,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:51,995 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2018-10-04 09:28:51,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:51,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:51,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:51,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:52,603 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 09:28:52,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:52,604 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 09:28:52,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:28:52,759 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-04 09:28:52,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:52,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:52,774 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 09:28:52,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:52,789 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 09:28:52,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:53,471 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 09:28:53,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:53,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 59 [2018-10-04 09:28:53,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-04 09:28:53,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-04 09:28:53,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=2233, Unknown=0, NotChecked=0, Total=3540 [2018-10-04 09:28:53,493 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2018-10-04 09:28:54,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:54,702 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-04 09:28:54,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-04 09:28:54,702 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2018-10-04 09:28:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:54,703 INFO L225 Difference]: With dead ends: 151 [2018-10-04 09:28:54,703 INFO L226 Difference]: Without dead ends: 150 [2018-10-04 09:28:54,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2609, Invalid=5047, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 09:28:54,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-04 09:28:54,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2018-10-04 09:28:54,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-04 09:28:54,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-04 09:28:54,731 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2018-10-04 09:28:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:54,732 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-04 09:28:54,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-04 09:28:54,732 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-04 09:28:54,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-04 09:28:54,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:54,733 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2018-10-04 09:28:54,733 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:54,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:54,734 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2018-10-04 09:28:54,734 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:54,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:54,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:54,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:54,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:55,448 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 09:28:55,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:55,448 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 09:28:55,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:28:55,559 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:28:55,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:55,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:55,567 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 09:28:55,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:55,577 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 09:28:55,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:56,414 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 09:28:56,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:56,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 61 [2018-10-04 09:28:56,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-04 09:28:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-04 09:28:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=2385, Unknown=0, NotChecked=0, Total=3782 [2018-10-04 09:28:56,437 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2018-10-04 09:28:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:28:57,687 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-04 09:28:57,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-04 09:28:57,687 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2018-10-04 09:28:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:28:57,688 INFO L225 Difference]: With dead ends: 156 [2018-10-04 09:28:57,688 INFO L226 Difference]: Without dead ends: 155 [2018-10-04 09:28:57,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2789, Invalid=5401, Unknown=0, NotChecked=0, Total=8190 [2018-10-04 09:28:57,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-04 09:28:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-04 09:28:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-04 09:28:57,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-04 09:28:57,718 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2018-10-04 09:28:57,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:28:57,719 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-04 09:28:57,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-04 09:28:57,719 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-04 09:28:57,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-04 09:28:57,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:28:57,720 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2018-10-04 09:28:57,720 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:28:57,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:28:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2018-10-04 09:28:57,721 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:28:57,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:28:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:57,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:28:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:28:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:28:58,582 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 09:28:58,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:28:58,582 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 09:28:58,591 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:28:58,740 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-04 09:28:58,740 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:28:58,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:28:58,757 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 09:28:58,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:28:58,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:28:58,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:28:59,920 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 09:28:59,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:28:59,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 63 [2018-10-04 09:28:59,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-04 09:28:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-04 09:28:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=2542, Unknown=0, NotChecked=0, Total=4032 [2018-10-04 09:28:59,943 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2018-10-04 09:29:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:01,296 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-04 09:29:01,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-04 09:29:01,296 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2018-10-04 09:29:01,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:01,297 INFO L225 Difference]: With dead ends: 161 [2018-10-04 09:29:01,297 INFO L226 Difference]: Without dead ends: 160 [2018-10-04 09:29:01,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2975, Invalid=5767, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 09:29:01,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-04 09:29:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-10-04 09:29:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-04 09:29:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-04 09:29:01,323 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2018-10-04 09:29:01,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:01,323 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-04 09:29:01,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-04 09:29:01,323 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-04 09:29:01,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-04 09:29:01,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:01,324 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2018-10-04 09:29:01,325 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:01,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:01,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2018-10-04 09:29:01,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:01,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:01,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:01,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:02,339 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 09:29:02,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:02,340 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 09:29:02,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:29:02,520 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-04 09:29:02,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:02,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:02,530 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 09:29:02,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:02,538 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 09:29:02,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:03,277 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 09:29:03,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:03,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2018-10-04 09:29:03,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-04 09:29:03,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-04 09:29:03,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1586, Invalid=2704, Unknown=0, NotChecked=0, Total=4290 [2018-10-04 09:29:03,299 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2018-10-04 09:29:04,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:04,625 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-04 09:29:04,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-04 09:29:04,625 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2018-10-04 09:29:04,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:04,626 INFO L225 Difference]: With dead ends: 166 [2018-10-04 09:29:04,626 INFO L226 Difference]: Without dead ends: 165 [2018-10-04 09:29:04,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3167, Invalid=6145, Unknown=0, NotChecked=0, Total=9312 [2018-10-04 09:29:04,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-04 09:29:04,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-10-04 09:29:04,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 09:29:04,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-04 09:29:04,661 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2018-10-04 09:29:04,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:04,661 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-04 09:29:04,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-04 09:29:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-04 09:29:04,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-04 09:29:04,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:04,662 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2018-10-04 09:29:04,663 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:04,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2018-10-04 09:29:04,663 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:04,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:04,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:06,009 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 09:29:06,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:06,009 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 09:29:06,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:29:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:06,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:06,127 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 09:29:06,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:06,144 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 09:29:06,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:06,927 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 09:29:06,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:06,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2018-10-04 09:29:06,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-04 09:29:06,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-04 09:29:06,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1685, Invalid=2871, Unknown=0, NotChecked=0, Total=4556 [2018-10-04 09:29:06,951 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2018-10-04 09:29:07,762 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 09:29:08,309 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-04 09:29:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:09,555 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-04 09:29:09,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-04 09:29:09,556 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2018-10-04 09:29:09,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:09,558 INFO L225 Difference]: With dead ends: 171 [2018-10-04 09:29:09,558 INFO L226 Difference]: Without dead ends: 170 [2018-10-04 09:29:09,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3365, Invalid=6535, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 09:29:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-04 09:29:09,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2018-10-04 09:29:09,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-04 09:29:09,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-04 09:29:09,592 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2018-10-04 09:29:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:09,592 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-04 09:29:09,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-04 09:29:09,593 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-04 09:29:09,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-04 09:29:09,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:09,594 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2018-10-04 09:29:09,594 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:09,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:09,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2018-10-04 09:29:09,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:09,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:09,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:09,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:29:09,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:09,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:10,804 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 09:29:10,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:10,804 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 09:29:10,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:29:10,924 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:29:10,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:10,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:10,944 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 09:29:10,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:10,953 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 09:29:10,953 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:11,831 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 09:29:11,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:11,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-10-04 09:29:11,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-04 09:29:11,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-04 09:29:11,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1787, Invalid=3043, Unknown=0, NotChecked=0, Total=4830 [2018-10-04 09:29:11,854 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2018-10-04 09:29:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:13,344 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-04 09:29:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-04 09:29:13,345 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2018-10-04 09:29:13,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:13,346 INFO L225 Difference]: With dead ends: 176 [2018-10-04 09:29:13,346 INFO L226 Difference]: Without dead ends: 175 [2018-10-04 09:29:13,347 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 09:29:13,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-04 09:29:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2018-10-04 09:29:13,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-04 09:29:13,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-04 09:29:13,383 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2018-10-04 09:29:13,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:13,383 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-04 09:29:13,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-04 09:29:13,383 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-04 09:29:13,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-04 09:29:13,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:13,384 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2018-10-04 09:29:13,385 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:13,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:13,385 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2018-10-04 09:29:13,385 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:13,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:13,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:13,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:13,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:15,045 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 09:29:15,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:15,045 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 09:29:15,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:29:15,246 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-04 09:29:15,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:15,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:15,255 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 09:29:15,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:15,264 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 09:29:15,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:16,211 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 09:29:16,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:16,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 71 [2018-10-04 09:29:16,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-04 09:29:16,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-04 09:29:16,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=3220, Unknown=0, NotChecked=0, Total=5112 [2018-10-04 09:29:16,233 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-10-04 09:29:17,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:17,687 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-04 09:29:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-04 09:29:17,688 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-10-04 09:29:17,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:17,689 INFO L225 Difference]: With dead ends: 181 [2018-10-04 09:29:17,689 INFO L226 Difference]: Without dead ends: 180 [2018-10-04 09:29:17,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3779, Invalid=7351, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 09:29:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-04 09:29:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2018-10-04 09:29:17,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-04 09:29:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-04 09:29:17,720 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2018-10-04 09:29:17,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:17,720 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-04 09:29:17,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-04 09:29:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-04 09:29:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-04 09:29:17,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:17,721 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2018-10-04 09:29:17,721 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:17,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:17,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2018-10-04 09:29:17,722 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:17,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:17,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:17,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:17,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:18,596 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 09:29:18,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:18,597 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 09:29:18,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:29:18,741 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:29:18,741 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:18,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:18,791 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 09:29:18,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:18,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:29:18,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:19,778 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 09:29:19,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:19,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 73 [2018-10-04 09:29:19,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-04 09:29:19,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-04 09:29:19,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2000, Invalid=3402, Unknown=0, NotChecked=0, Total=5402 [2018-10-04 09:29:19,800 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2018-10-04 09:29:21,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:21,543 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-04 09:29:21,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-04 09:29:21,544 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2018-10-04 09:29:21,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:21,545 INFO L225 Difference]: With dead ends: 186 [2018-10-04 09:29:21,545 INFO L226 Difference]: Without dead ends: 185 [2018-10-04 09:29:21,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3995, Invalid=7777, Unknown=0, NotChecked=0, Total=11772 [2018-10-04 09:29:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-04 09:29:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-04 09:29:21,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-04 09:29:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-04 09:29:21,585 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2018-10-04 09:29:21,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:21,586 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-04 09:29:21,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-04 09:29:21,586 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-04 09:29:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-04 09:29:21,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:21,587 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2018-10-04 09:29:21,587 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:21,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2018-10-04 09:29:21,588 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:21,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:21,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:21,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:21,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:22,710 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 09:29:22,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:22,710 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 09:29:22,717 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:29:22,912 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-10-04 09:29:22,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:22,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:22,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 09:29:22,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:23,005 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 09:29:23,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:24,032 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 09:29:24,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:24,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 75 [2018-10-04 09:29:24,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-04 09:29:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-04 09:29:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=3589, Unknown=0, NotChecked=0, Total=5700 [2018-10-04 09:29:24,054 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2018-10-04 09:29:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:25,895 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-04 09:29:25,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-04 09:29:25,896 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2018-10-04 09:29:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:25,897 INFO L225 Difference]: With dead ends: 191 [2018-10-04 09:29:25,897 INFO L226 Difference]: Without dead ends: 190 [2018-10-04 09:29:25,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4217, Invalid=8215, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 09:29:25,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-04 09:29:25,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-10-04 09:29:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-04 09:29:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-04 09:29:25,927 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2018-10-04 09:29:25,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:25,927 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-04 09:29:25,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-04 09:29:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-04 09:29:25,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-04 09:29:25,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:25,928 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2018-10-04 09:29:25,928 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:25,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:25,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2018-10-04 09:29:25,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:25,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:25,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:25,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:25,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:26,854 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 09:29:26,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:26,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 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 09:29:26,863 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:29:27,089 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-04 09:29:27,089 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:27,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:27,126 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 09:29:27,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:27,219 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 09:29:27,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:29,185 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 09:29:29,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:29,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 77 [2018-10-04 09:29:29,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-04 09:29:29,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-04 09:29:29,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2225, Invalid=3781, Unknown=0, NotChecked=0, Total=6006 [2018-10-04 09:29:29,207 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2018-10-04 09:29:31,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:31,135 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-04 09:29:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-04 09:29:31,136 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2018-10-04 09:29:31,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:31,137 INFO L225 Difference]: With dead ends: 196 [2018-10-04 09:29:31,137 INFO L226 Difference]: Without dead ends: 195 [2018-10-04 09:29:31,138 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4445, Invalid=8665, Unknown=0, NotChecked=0, Total=13110 [2018-10-04 09:29:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-04 09:29:31,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2018-10-04 09:29:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-04 09:29:31,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-04 09:29:31,172 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2018-10-04 09:29:31,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:31,172 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-04 09:29:31,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-04 09:29:31,172 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-04 09:29:31,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-04 09:29:31,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:31,173 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2018-10-04 09:29:31,173 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:31,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:31,174 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2018-10-04 09:29:31,174 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:31,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:31,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:31,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:31,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:32,352 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 09:29:32,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:32,353 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 09:29:32,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:29:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:32,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:32,513 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 09:29:32,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:32,584 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 09:29:32,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:33,653 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 09:29:33,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:33,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 79 [2018-10-04 09:29:33,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-04 09:29:33,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-04 09:29:33,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2342, Invalid=3978, Unknown=0, NotChecked=0, Total=6320 [2018-10-04 09:29:33,675 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2018-10-04 09:29:35,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:35,442 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-04 09:29:35,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-04 09:29:35,443 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2018-10-04 09:29:35,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:35,444 INFO L225 Difference]: With dead ends: 201 [2018-10-04 09:29:35,444 INFO L226 Difference]: Without dead ends: 200 [2018-10-04 09:29:35,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4679, Invalid=9127, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 09:29:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-04 09:29:35,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-10-04 09:29:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-04 09:29:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-04 09:29:35,481 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2018-10-04 09:29:35,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:35,481 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-04 09:29:35,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-04 09:29:35,481 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-04 09:29:35,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-04 09:29:35,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:35,482 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2018-10-04 09:29:35,482 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:35,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:35,483 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2018-10-04 09:29:35,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:35,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:35,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:29:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:36,618 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 09:29:36,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:36,619 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:29:36,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:29:36,780 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:29:36,780 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:36,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:36,790 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 09:29:36,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:36,801 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 09:29:36,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:37,963 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 09:29:37,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:37,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 81 [2018-10-04 09:29:37,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-04 09:29:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-04 09:29:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2462, Invalid=4180, Unknown=0, NotChecked=0, Total=6642 [2018-10-04 09:29:37,985 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2018-10-04 09:29:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:40,108 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-04 09:29:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-04 09:29:40,109 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2018-10-04 09:29:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:40,110 INFO L225 Difference]: With dead ends: 206 [2018-10-04 09:29:40,110 INFO L226 Difference]: Without dead ends: 205 [2018-10-04 09:29:40,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4919, Invalid=9601, Unknown=0, NotChecked=0, Total=14520 [2018-10-04 09:29:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-04 09:29:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-10-04 09:29:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-04 09:29:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-04 09:29:40,144 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2018-10-04 09:29:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:40,144 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-04 09:29:40,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-04 09:29:40,144 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-04 09:29:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-04 09:29:40,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:40,145 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2018-10-04 09:29:40,145 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:40,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:40,146 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2018-10-04 09:29:40,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:40,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:40,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:40,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:40,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:41,393 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 09:29:41,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:41,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:29:41,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:29:41,680 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-10-04 09:29:41,680 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:41,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:41,689 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 09:29:41,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:41,699 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 09:29:41,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:42,948 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 09:29:42,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:42,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 83 [2018-10-04 09:29:42,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-04 09:29:42,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-04 09:29:42,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2585, Invalid=4387, Unknown=0, NotChecked=0, Total=6972 [2018-10-04 09:29:42,970 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2018-10-04 09:29:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:44,826 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-04 09:29:44,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-04 09:29:44,826 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2018-10-04 09:29:44,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:44,827 INFO L225 Difference]: With dead ends: 211 [2018-10-04 09:29:44,827 INFO L226 Difference]: Without dead ends: 210 [2018-10-04 09:29:44,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5165, Invalid=10087, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 09:29:44,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-04 09:29:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2018-10-04 09:29:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-04 09:29:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-04 09:29:44,865 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2018-10-04 09:29:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:44,865 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-04 09:29:44,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-04 09:29:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-04 09:29:44,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-04 09:29:44,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:44,866 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2018-10-04 09:29:44,867 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:44,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:44,867 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2018-10-04 09:29:44,867 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:44,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:44,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:44,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:44,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:46,007 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 09:29:46,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:46,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:29:46,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:29:46,160 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:29:46,160 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:46,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:46,171 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 09:29:46,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:46,185 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 09:29:46,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:47,431 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 09:29:47,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:47,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 85 [2018-10-04 09:29:47,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-04 09:29:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-04 09:29:47,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2711, Invalid=4599, Unknown=0, NotChecked=0, Total=7310 [2018-10-04 09:29:47,454 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2018-10-04 09:29:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:49,478 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-04 09:29:49,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-04 09:29:49,478 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2018-10-04 09:29:49,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:49,479 INFO L225 Difference]: With dead ends: 216 [2018-10-04 09:29:49,479 INFO L226 Difference]: Without dead ends: 215 [2018-10-04 09:29:49,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5417, Invalid=10585, Unknown=0, NotChecked=0, Total=16002 [2018-10-04 09:29:49,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-04 09:29:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-10-04 09:29:49,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-04 09:29:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-04 09:29:49,518 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2018-10-04 09:29:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:49,519 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-04 09:29:49,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-04 09:29:49,519 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-04 09:29:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-04 09:29:49,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:49,520 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2018-10-04 09:29:49,520 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:49,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2018-10-04 09:29:49,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:49,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:49,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:49,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:50,667 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 09:29:50,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:50,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 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 09:29:50,675 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:29:50,913 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-10-04 09:29:50,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:50,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:50,940 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 09:29:50,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:50,949 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 09:29:50,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:52,387 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 09:29:52,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:52,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 87 [2018-10-04 09:29:52,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-04 09:29:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-04 09:29:52,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2840, Invalid=4816, Unknown=0, NotChecked=0, Total=7656 [2018-10-04 09:29:52,410 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2018-10-04 09:29:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:54,487 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-04 09:29:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-04 09:29:54,487 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2018-10-04 09:29:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:54,488 INFO L225 Difference]: With dead ends: 221 [2018-10-04 09:29:54,488 INFO L226 Difference]: Without dead ends: 220 [2018-10-04 09:29:54,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5675, Invalid=11095, Unknown=0, NotChecked=0, Total=16770 [2018-10-04 09:29:54,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-04 09:29:54,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-04 09:29:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-04 09:29:54,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-04 09:29:54,527 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2018-10-04 09:29:54,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:54,528 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-04 09:29:54,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-04 09:29:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-04 09:29:54,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-04 09:29:54,529 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:54,529 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2018-10-04 09:29:54,529 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:54,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:54,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2018-10-04 09:29:54,529 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:54,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:54,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:54,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:54,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:54,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:29:55,908 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 09:29:55,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:29:55,908 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 09:29:55,916 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:29:56,191 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-10-04 09:29:56,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:29:56,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:29:56,201 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 09:29:56,201 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:29:56,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:29:56,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:29:57,564 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 09:29:57,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:29:57,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 89 [2018-10-04 09:29:57,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-04 09:29:57,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-04 09:29:57,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=5038, Unknown=0, NotChecked=0, Total=8010 [2018-10-04 09:29:57,587 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2018-10-04 09:29:59,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:29:59,757 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-04 09:29:59,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-04 09:29:59,757 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2018-10-04 09:29:59,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:29:59,758 INFO L225 Difference]: With dead ends: 226 [2018-10-04 09:29:59,758 INFO L226 Difference]: Without dead ends: 225 [2018-10-04 09:29:59,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5939, Invalid=11617, Unknown=0, NotChecked=0, Total=17556 [2018-10-04 09:29:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-04 09:29:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-10-04 09:29:59,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-04 09:29:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-04 09:29:59,798 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2018-10-04 09:29:59,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:29:59,798 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-04 09:29:59,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-04 09:29:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-04 09:29:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-04 09:29:59,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:29:59,800 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2018-10-04 09:29:59,800 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:29:59,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:29:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2018-10-04 09:29:59,800 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:29:59,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:29:59,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:59,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:29:59,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:29:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:00,984 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 09:30:00,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:00,984 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 09:30:00,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:01,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:01,155 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 09:30:01,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:01,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:30:01,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:03,330 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 09:30:03,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:03,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 91 [2018-10-04 09:30:03,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-04 09:30:03,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-04 09:30:03,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3107, Invalid=5265, Unknown=0, NotChecked=0, Total=8372 [2018-10-04 09:30:03,353 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2018-10-04 09:30:05,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:05,689 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-04 09:30:05,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-04 09:30:05,690 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2018-10-04 09:30:05,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:05,691 INFO L225 Difference]: With dead ends: 231 [2018-10-04 09:30:05,691 INFO L226 Difference]: Without dead ends: 230 [2018-10-04 09:30:05,692 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 09:30:05,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-04 09:30:05,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2018-10-04 09:30:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-04 09:30:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-04 09:30:05,748 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2018-10-04 09:30:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:05,748 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-04 09:30:05,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-04 09:30:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-04 09:30:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-04 09:30:05,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:05,750 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2018-10-04 09:30:05,750 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:05,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:05,750 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2018-10-04 09:30:05,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:05,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:05,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:05,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:07,442 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 09:30:07,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:07,442 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 09:30:07,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:30:07,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:30:07,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:07,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:07,615 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 09:30:07,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:07,625 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 09:30:07,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:09,073 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 09:30:09,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:09,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 93 [2018-10-04 09:30:09,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-04 09:30:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-04 09:30:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=5497, Unknown=0, NotChecked=0, Total=8742 [2018-10-04 09:30:09,098 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2018-10-04 09:30:11,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:11,435 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-04 09:30:11,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-04 09:30:11,436 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2018-10-04 09:30:11,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:11,437 INFO L225 Difference]: With dead ends: 236 [2018-10-04 09:30:11,437 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 09:30:11,439 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 09:30:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 09:30:11,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2018-10-04 09:30:11,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-04 09:30:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-04 09:30:11,487 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2018-10-04 09:30:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:11,487 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-04 09:30:11,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-04 09:30:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-04 09:30:11,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-04 09:30:11,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:11,489 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2018-10-04 09:30:11,489 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:11,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:11,490 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2018-10-04 09:30:11,490 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:11,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:11,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:11,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:11,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:13,205 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 09:30:13,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:13,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:30:13,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:30:13,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-10-04 09:30:13,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:13,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:13,532 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 09:30:13,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:13,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:30:13,542 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:15,136 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 09:30:15,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:15,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 95 [2018-10-04 09:30:15,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-04 09:30:15,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-04 09:30:15,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3386, Invalid=5734, Unknown=0, NotChecked=0, Total=9120 [2018-10-04 09:30:15,159 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2018-10-04 09:30:17,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:17,753 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-04 09:30:17,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-04 09:30:17,753 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2018-10-04 09:30:17,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:17,754 INFO L225 Difference]: With dead ends: 241 [2018-10-04 09:30:17,755 INFO L226 Difference]: Without dead ends: 240 [2018-10-04 09:30:17,756 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 09:30:17,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-04 09:30:17,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-10-04 09:30:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 09:30:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-04 09:30:17,813 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2018-10-04 09:30:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:17,813 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-04 09:30:17,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-04 09:30:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-04 09:30:17,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-04 09:30:17,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:17,815 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2018-10-04 09:30:17,815 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:17,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:17,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2018-10-04 09:30:17,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:17,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:17,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:17,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:17,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:19,148 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 09:30:19,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:19,148 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 09:30:19,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:30:19,321 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:30:19,322 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:19,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:19,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 09:30:19,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:19,370 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 09:30:19,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:20,919 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 09:30:20,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:20,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 97 [2018-10-04 09:30:20,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-04 09:30:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-04 09:30:20,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3530, Invalid=5976, Unknown=0, NotChecked=0, Total=9506 [2018-10-04 09:30:20,942 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2018-10-04 09:30:23,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:23,606 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-04 09:30:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-04 09:30:23,607 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2018-10-04 09:30:23,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:23,608 INFO L225 Difference]: With dead ends: 246 [2018-10-04 09:30:23,608 INFO L226 Difference]: Without dead ends: 245 [2018-10-04 09:30:23,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7055, Invalid=13825, Unknown=0, NotChecked=0, Total=20880 [2018-10-04 09:30:23,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-04 09:30:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-10-04 09:30:23,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-04 09:30:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-04 09:30:23,684 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2018-10-04 09:30:23,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:23,684 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-04 09:30:23,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-04 09:30:23,684 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-04 09:30:23,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-04 09:30:23,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:23,685 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2018-10-04 09:30:23,686 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:23,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:23,686 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2018-10-04 09:30:23,686 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:23,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:23,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:25,158 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 09:30:25,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:25,158 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 09:30:25,165 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:30:25,432 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-10-04 09:30:25,432 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:25,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:25,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:30:25,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:25,453 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 09:30:25,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:27,215 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 09:30:27,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:27,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2018-10-04 09:30:27,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-04 09:30:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-04 09:30:27,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3677, Invalid=6223, Unknown=0, NotChecked=0, Total=9900 [2018-10-04 09:30:27,238 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2018-10-04 09:30:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:29,834 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-04 09:30:29,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-04 09:30:29,834 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2018-10-04 09:30:29,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:29,835 INFO L225 Difference]: With dead ends: 251 [2018-10-04 09:30:29,835 INFO L226 Difference]: Without dead ends: 250 [2018-10-04 09:30:29,836 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7349, Invalid=14407, Unknown=0, NotChecked=0, Total=21756 [2018-10-04 09:30:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-04 09:30:29,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-10-04 09:30:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-04 09:30:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-04 09:30:29,890 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2018-10-04 09:30:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:29,891 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-04 09:30:29,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-04 09:30:29,891 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-04 09:30:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-04 09:30:29,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:29,892 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2018-10-04 09:30:29,892 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:29,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:29,892 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2018-10-04 09:30:29,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:29,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:29,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:29,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:31,562 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 09:30:31,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:31,563 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 09:30:31,571 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:30:31,909 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-10-04 09:30:31,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:31,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:31,920 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 09:30:31,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:31,931 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 09:30:31,931 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:33,972 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 09:30:33,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:33,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 101 [2018-10-04 09:30:33,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-04 09:30:33,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-04 09:30:33,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3827, Invalid=6475, Unknown=0, NotChecked=0, Total=10302 [2018-10-04 09:30:33,996 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2018-10-04 09:30:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:36,663 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-04 09:30:36,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-04 09:30:36,663 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2018-10-04 09:30:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:36,664 INFO L225 Difference]: With dead ends: 256 [2018-10-04 09:30:36,665 INFO L226 Difference]: Without dead ends: 255 [2018-10-04 09:30:36,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7649, Invalid=15001, Unknown=0, NotChecked=0, Total=22650 [2018-10-04 09:30:36,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-04 09:30:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2018-10-04 09:30:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-04 09:30:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-04 09:30:36,717 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2018-10-04 09:30:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:36,717 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-04 09:30:36,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-04 09:30:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-04 09:30:36,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-04 09:30:36,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:36,719 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2018-10-04 09:30:36,719 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:36,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:36,720 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2018-10-04 09:30:36,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:36,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:36,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:38,498 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 09:30:38,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:38,499 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 09:30:38,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:38,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:38,682 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 09:30:38,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:38,693 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 09:30:38,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:40,475 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 09:30:40,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:40,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 103 [2018-10-04 09:30:40,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-04 09:30:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-04 09:30:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3980, Invalid=6732, Unknown=0, NotChecked=0, Total=10712 [2018-10-04 09:30:40,498 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2018-10-04 09:30:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:43,549 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-04 09:30:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-04 09:30:43,550 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2018-10-04 09:30:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:43,551 INFO L225 Difference]: With dead ends: 261 [2018-10-04 09:30:43,551 INFO L226 Difference]: Without dead ends: 260 [2018-10-04 09:30:43,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7955, Invalid=15607, Unknown=0, NotChecked=0, Total=23562 [2018-10-04 09:30:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-04 09:30:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2018-10-04 09:30:43,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-04 09:30:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-04 09:30:43,622 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2018-10-04 09:30:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:43,622 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-04 09:30:43,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-04 09:30:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-04 09:30:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-04 09:30:43,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:43,624 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2018-10-04 09:30:43,624 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:43,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:43,624 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2018-10-04 09:30:43,625 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:43,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:43,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:30:43,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:45,295 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 09:30:45,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:45,295 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 09:30:45,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:30:45,485 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:30:45,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:45,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:45,500 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 09:30:45,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:45,508 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 09:30:45,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:47,335 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 09:30:47,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:47,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 105 [2018-10-04 09:30:47,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-04 09:30:47,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-04 09:30:47,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4136, Invalid=6994, Unknown=0, NotChecked=0, Total=11130 [2018-10-04 09:30:47,361 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2018-10-04 09:30:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:50,334 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-04 09:30:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-04 09:30:50,335 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2018-10-04 09:30:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:50,336 INFO L225 Difference]: With dead ends: 266 [2018-10-04 09:30:50,336 INFO L226 Difference]: Without dead ends: 265 [2018-10-04 09:30:50,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8267, Invalid=16225, Unknown=0, NotChecked=0, Total=24492 [2018-10-04 09:30:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-04 09:30:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2018-10-04 09:30:50,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-04 09:30:50,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-04 09:30:50,388 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2018-10-04 09:30:50,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:50,389 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-04 09:30:50,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-04 09:30:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-04 09:30:50,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-04 09:30:50,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:50,390 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2018-10-04 09:30:50,390 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:50,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:50,390 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2018-10-04 09:30:50,390 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:50,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:50,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:50,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:51,881 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 09:30:51,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:51,881 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 09:30:51,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:30:52,294 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-10-04 09:30:52,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:52,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:52,309 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 09:30:52,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:52,321 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 09:30:52,321 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:30:54,473 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 09:30:54,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:30:54,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 107 [2018-10-04 09:30:54,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-04 09:30:54,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-04 09:30:54,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=7261, Unknown=0, NotChecked=0, Total=11556 [2018-10-04 09:30:54,496 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2018-10-04 09:30:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:30:57,459 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-04 09:30:57,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-04 09:30:57,459 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2018-10-04 09:30:57,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:30:57,460 INFO L225 Difference]: With dead ends: 271 [2018-10-04 09:30:57,460 INFO L226 Difference]: Without dead ends: 270 [2018-10-04 09:30:57,462 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 09:30:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-04 09:30:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2018-10-04 09:30:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-04 09:30:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-04 09:30:57,520 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2018-10-04 09:30:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:30:57,520 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-04 09:30:57,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-04 09:30:57,520 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-04 09:30:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-04 09:30:57,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:30:57,521 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2018-10-04 09:30:57,521 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:30:57,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:30:57,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2018-10-04 09:30:57,522 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:30:57,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:30:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:57,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:30:57,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:30:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:30:59,151 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 09:30:59,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:30:59,152 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:30:59,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:30:59,348 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:30:59,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:30:59,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:30:59,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:30:59,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:30:59,370 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 09:30:59,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:01,312 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 09:31:01,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:01,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 109 [2018-10-04 09:31:01,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-04 09:31:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-04 09:31:01,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4457, Invalid=7533, Unknown=0, NotChecked=0, Total=11990 [2018-10-04 09:31:01,335 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2018-10-04 09:31:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:04,612 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-04 09:31:04,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-04 09:31:04,613 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2018-10-04 09:31:04,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:04,614 INFO L225 Difference]: With dead ends: 276 [2018-10-04 09:31:04,614 INFO L226 Difference]: Without dead ends: 275 [2018-10-04 09:31:04,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8909, Invalid=17497, Unknown=0, NotChecked=0, Total=26406 [2018-10-04 09:31:04,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-04 09:31:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-04 09:31:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-04 09:31:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-04 09:31:04,696 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2018-10-04 09:31:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:04,696 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-04 09:31:04,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-04 09:31:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-04 09:31:04,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-04 09:31:04,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:04,698 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2018-10-04 09:31:04,698 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:31:04,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:04,699 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2018-10-04 09:31:04,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:04,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:04,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:04,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:06,350 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 09:31:06,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:06,350 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 09:31:06,361 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:31:06,706 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-10-04 09:31:06,706 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:06,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:06,717 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 09:31:06,718 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:31:06,729 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 09:31:06,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:09,013 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 09:31:09,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:09,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 111 [2018-10-04 09:31:09,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-04 09:31:09,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-04 09:31:09,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4622, Invalid=7810, Unknown=0, NotChecked=0, Total=12432 [2018-10-04 09:31:09,037 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2018-10-04 09:31:12,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:12,251 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-04 09:31:12,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-04 09:31:12,252 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2018-10-04 09:31:12,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:12,253 INFO L225 Difference]: With dead ends: 281 [2018-10-04 09:31:12,253 INFO L226 Difference]: Without dead ends: 280 [2018-10-04 09:31:12,254 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 09:31:12,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-04 09:31:12,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-10-04 09:31:12,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-04 09:31:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-04 09:31:12,326 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2018-10-04 09:31:12,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:12,327 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-04 09:31:12,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-04 09:31:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-04 09:31:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-04 09:31:12,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:12,329 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2018-10-04 09:31:12,329 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:31:12,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2018-10-04 09:31:12,329 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:12,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:12,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:14,255 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 09:31:14,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:14,256 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 09:31:14,263 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-04 09:31:14,700 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-10-04 09:31:14,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:14,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:14,712 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 09:31:14,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:31:14,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 09:31:14,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:16,832 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 09:31:16,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:16,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 113 [2018-10-04 09:31:16,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-04 09:31:16,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-04 09:31:16,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4790, Invalid=8092, Unknown=0, NotChecked=0, Total=12882 [2018-10-04 09:31:16,856 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2018-10-04 09:31:20,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:20,228 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-04 09:31:20,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-04 09:31:20,228 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2018-10-04 09:31:20,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:20,229 INFO L225 Difference]: With dead ends: 286 [2018-10-04 09:31:20,229 INFO L226 Difference]: Without dead ends: 285 [2018-10-04 09:31:20,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9575, Invalid=18817, Unknown=0, NotChecked=0, Total=28392 [2018-10-04 09:31:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-04 09:31:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2018-10-04 09:31:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-04 09:31:20,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-04 09:31:20,302 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2018-10-04 09:31:20,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:20,302 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-04 09:31:20,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-04 09:31:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-04 09:31:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-04 09:31:20,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:20,303 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2018-10-04 09:31:20,304 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:31:20,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:20,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2018-10-04 09:31:20,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:20,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:20,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:20,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:20,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:20,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:22,029 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 09:31:22,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:22,029 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:31:22,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:31:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:22,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:22,246 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 09:31:22,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:31:22,254 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 09:31:22,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:24,557 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 09:31:24,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:24,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 115 [2018-10-04 09:31:24,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-04 09:31:24,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-04 09:31:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4961, Invalid=8379, Unknown=0, NotChecked=0, Total=13340 [2018-10-04 09:31:24,580 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2018-10-04 09:31:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:27,985 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-04 09:31:27,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-04 09:31:27,985 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2018-10-04 09:31:27,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:27,986 INFO L225 Difference]: With dead ends: 291 [2018-10-04 09:31:27,986 INFO L226 Difference]: Without dead ends: 290 [2018-10-04 09:31:27,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9917, Invalid=19495, Unknown=0, NotChecked=0, Total=29412 [2018-10-04 09:31:27,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-04 09:31:28,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2018-10-04 09:31:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-04 09:31:28,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-04 09:31:28,052 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2018-10-04 09:31:28,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:28,053 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-04 09:31:28,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-04 09:31:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-04 09:31:28,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-04 09:31:28,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:28,054 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2018-10-04 09:31:28,054 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:31:28,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:28,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2018-10-04 09:31:28,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:28,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:28,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:28,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:31:28,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:30,055 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 09:31:30,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:30,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 09:31:30,063 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-04 09:31:30,253 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-04 09:31:30,254 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:30,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:30,265 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 09:31:30,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:31:30,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:31:30,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:32,381 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 09:31:32,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:32,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 117 [2018-10-04 09:31:32,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-04 09:31:32,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-04 09:31:32,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5135, Invalid=8671, Unknown=0, NotChecked=0, Total=13806 [2018-10-04 09:31:32,405 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2018-10-04 09:31:35,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:35,850 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-04 09:31:35,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-04 09:31:35,850 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2018-10-04 09:31:35,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:35,851 INFO L225 Difference]: With dead ends: 296 [2018-10-04 09:31:35,851 INFO L226 Difference]: Without dead ends: 295 [2018-10-04 09:31:35,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10265, Invalid=20185, Unknown=0, NotChecked=0, Total=30450 [2018-10-04 09:31:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-04 09:31:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2018-10-04 09:31:35,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-04 09:31:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-04 09:31:35,919 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2018-10-04 09:31:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:35,920 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-04 09:31:35,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-04 09:31:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-04 09:31:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-04 09:31:35,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:35,921 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2018-10-04 09:31:35,922 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:31:35,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2018-10-04 09:31:35,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:35,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:35,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:35,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:35,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:35,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:37,741 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 09:31:37,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:37,741 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 09:31:37,750 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-04 09:31:38,170 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-10-04 09:31:38,170 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:38,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:38,187 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 09:31:38,187 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:31:38,194 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 09:31:38,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:40,575 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 09:31:40,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:40,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 119 [2018-10-04 09:31:40,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-04 09:31:40,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-04 09:31:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5312, Invalid=8968, Unknown=0, NotChecked=0, Total=14280 [2018-10-04 09:31:40,599 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2018-10-04 09:31:44,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:44,129 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-04 09:31:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-04 09:31:44,129 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2018-10-04 09:31:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:44,130 INFO L225 Difference]: With dead ends: 301 [2018-10-04 09:31:44,131 INFO L226 Difference]: Without dead ends: 300 [2018-10-04 09:31:44,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10619, Invalid=20887, Unknown=0, NotChecked=0, Total=31506 [2018-10-04 09:31:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-04 09:31:44,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2018-10-04 09:31:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-04 09:31:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-04 09:31:44,204 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2018-10-04 09:31:44,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:44,204 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-04 09:31:44,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-04 09:31:44,204 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-04 09:31:44,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-04 09:31:44,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:44,206 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2018-10-04 09:31:44,206 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:31:44,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:44,206 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2018-10-04 09:31:44,206 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:44,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:44,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:44,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:44,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:46,064 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 09:31:46,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:46,065 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 09:31:46,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-04 09:31:46,277 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-04 09:31:46,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:46,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:46,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-10-04 09:31:46,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:31:46,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-04 09:31:46,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:48,496 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 09:31:48,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:48,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 121 [2018-10-04 09:31:48,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-04 09:31:48,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-04 09:31:48,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5492, Invalid=9270, Unknown=0, NotChecked=0, Total=14762 [2018-10-04 09:31:48,519 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2018-10-04 09:31:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:31:51,949 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-04 09:31:51,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-04 09:31:51,950 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2018-10-04 09:31:51,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:31:51,951 INFO L225 Difference]: With dead ends: 306 [2018-10-04 09:31:51,951 INFO L226 Difference]: Without dead ends: 305 [2018-10-04 09:31:51,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10979, Invalid=21601, Unknown=0, NotChecked=0, Total=32580 [2018-10-04 09:31:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-04 09:31:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-10-04 09:31:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-04 09:31:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-04 09:31:52,029 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2018-10-04 09:31:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:31:52,029 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-04 09:31:52,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-04 09:31:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-04 09:31:52,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-04 09:31:52,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:31:52,031 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2018-10-04 09:31:52,031 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:31:52,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:31:52,031 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2018-10-04 09:31:52,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:31:52,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:31:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:52,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:31:52,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:31:52,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:31:53,960 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 09:31:53,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:31:53,961 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 09:31:53,967 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-04 09:31:54,376 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-10-04 09:31:54,376 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:31:54,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:31:54,401 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 09:31:54,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-04 09:31:54,410 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 09:31:54,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-04 09:31:56,685 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 09:31:56,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:31:56,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 123 [2018-10-04 09:31:56,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-04 09:31:56,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-04 09:31:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5675, Invalid=9577, Unknown=0, NotChecked=0, Total=15252 [2018-10-04 09:31:56,709 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2018-10-04 09:32:00,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:32:00,312 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-04 09:32:00,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-04 09:32:00,320 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2018-10-04 09:32:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:32:00,322 INFO L225 Difference]: With dead ends: 311 [2018-10-04 09:32:00,322 INFO L226 Difference]: Without dead ends: 310 [2018-10-04 09:32:00,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=11345, Invalid=22327, Unknown=0, NotChecked=0, Total=33672 [2018-10-04 09:32:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-04 09:32:00,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2018-10-04 09:32:00,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-04 09:32:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-04 09:32:00,434 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2018-10-04 09:32:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:32:00,435 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-04 09:32:00,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-04 09:32:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-04 09:32:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-04 09:32:00,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:32:00,436 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2018-10-04 09:32:00,436 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-10-04 09:32:00,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 09:32:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2018-10-04 09:32:00,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:32:00,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:32:00,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:00,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-04 09:32:00,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:32:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:32:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:32:02,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:32:02,367 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:32:02,374 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... [2018-10-04 09:32:02,874 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-10-04 09:32:02,874 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-04 09:32:02,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:32:02,885 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-04 09:32:03,086 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:32:03,086 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-04 09:32:03,093 WARN L205 ceAbstractionStarter]: Timeout [2018-10-04 09:32:03,093 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:32:03 BoogieIcfgContainer [2018-10-04 09:32:03,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:32:03,094 INFO L168 Benchmark]: Toolchain (without parser) took 238506.69 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.9 GB in the end (delta: -1.4 GB). Peak memory consumption was 873.5 MB. Max. memory is 7.1 GB. [2018-10-04 09:32:03,095 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 09:32:03,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.34 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 09:32:03,095 INFO L168 Benchmark]: Boogie Preprocessor took 28.66 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 09:32:03,095 INFO L168 Benchmark]: RCFGBuilder took 334.07 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 09:32:03,096 INFO L168 Benchmark]: TraceAbstraction took 238071.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.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 852.3 MB. Max. memory is 7.1 GB. [2018-10-04 09:32:03,097 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 67.34 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 28.66 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 334.07 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 238071.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.4 GB in the beginning and 2.9 GB in the end (delta: -1.5 GB). Peak memory consumption was 852.3 MB. 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 TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 5 quantified variables from 5 xjuncts. - 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 TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 5 quantified variables from 5 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. TIMEOUT Result, 237.9s OverallTime, 63 OverallIterations, 61 TraceHistogramMax, 97.2s 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.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12932 GetRequests, 7320 SyntacticMatches, 0 SemanticMatches, 5612 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221132 ImplicationChecksByTransitivity, 176.4s 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: 2.0s AutomataMinimizationTime, 62 MinimizatonAttempts, 185 StatesRemovedByMinimization, 61 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.7s SsaConstructionTime, 9.2s SatisfiabilityAnalysisTime, 120.1s 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_09-32-03-107.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_09-32-03-107.csv Completed graceful shutdown