java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:40:47,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:40:47,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:40:47,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:40:47,171 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:40:47,172 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:40:47,173 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:40:47,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:40:47,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:40:47,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:40:47,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:40:47,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:40:47,183 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:40:47,184 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:40:47,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:40:47,186 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:40:47,187 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:40:47,189 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:40:47,198 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:40:47,203 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:40:47,204 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:40:47,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:40:47,210 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:40:47,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:40:47,210 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:40:47,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:40:47,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:40:47,214 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:40:47,214 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:40:47,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:40:47,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:40:47,219 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:40:47,219 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:40:47,219 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:40:47,220 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:40:47,223 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:40:47,223 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:40:47,240 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:40:47,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:40:47,241 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:40:47,242 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:40:47,242 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:40:47,242 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:40:47,242 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:40:47,243 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:40:47,243 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:40:47,243 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:40:47,243 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:40:47,243 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:40:47,244 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:40:47,244 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:40:47,244 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:40:47,244 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:40:47,244 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:40:47,245 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:40:47,245 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:40:47,245 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:40:47,245 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:40:47,246 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:40:47,246 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:40:47,246 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:40:47,246 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:40:47,246 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:40:47,246 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:40:47,247 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:40:47,247 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:40:47,247 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:40:47,247 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:40:47,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:40:47,306 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:40:47,311 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:40:47,312 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:40:47,313 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:40:47,314 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl [2018-10-01 00:40:47,314 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/diamond1.i_3.bpl' [2018-10-01 00:40:47,378 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:40:47,381 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:40:47,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:40:47,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:40:47,382 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:40:47,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:40:47,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:40:47,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:40:47,421 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:40:47,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,433 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/1) ... [2018-10-01 00:40:47,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:40:47,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:40:47,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:40:47,448 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:40:47,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (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-01 00:40:47,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-01 00:40:47,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-01 00:40:47,726 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-01 00:40:47,726 INFO L202 PluginConnector]: Adding new model diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:40:47 BoogieIcfgContainer [2018-10-01 00:40:47,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:40:47,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:40:47,728 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:40:47,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:40:47,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:40:47" (1/2) ... [2018-10-01 00:40:47,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2716fef6 and model type diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:40:47, skipping insertion in model container [2018-10-01 00:40:47,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "diamond1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:40:47" (2/2) ... [2018-10-01 00:40:47,735 INFO L112 eAbstractionObserver]: Analyzing ICFG diamond1.i_3.bpl [2018-10-01 00:40:47,745 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:40:47,756 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:40:47,811 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:40:47,812 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:40:47,813 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:40:47,813 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:40:47,813 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:40:47,813 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:40:47,813 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:40:47,814 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:40:47,814 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:40:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-10-01 00:40:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:40:47,841 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:47,842 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-10-01 00:40:47,843 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:47,850 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:47,850 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-10-01 00:40:47,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:47,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:47,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:47,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:47,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:48,073 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-01 00:40:48,076 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:40:48,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-01 00:40:48,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:40:48,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:40:48,093 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:48,095 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-10-01 00:40:48,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:48,232 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-10-01 00:40:48,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:40:48,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-10-01 00:40:48,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:48,251 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:40:48,251 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:40:48,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:40:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:40:48,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:40:48,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:40:48,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:40:48,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-10-01 00:40:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:48,308 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:40:48,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:40:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:40:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:40:48,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:48,309 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-10-01 00:40:48,310 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:48,310 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:48,310 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-10-01 00:40:48,311 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:48,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:48,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:48,435 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:48,436 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:40:48,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:48,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:48,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:48,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:40:48,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:40:48,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:40:48,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:48,706 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-10-01 00:40:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:48,859 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 00:40:48,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:40:48,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-10-01 00:40:48,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:48,861 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:40:48,861 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:40:48,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:40:48,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:40:48,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:40:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:40:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:40:48,866 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-10-01 00:40:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:48,866 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:40:48,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:40:48,867 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:40:48,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:40:48,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:48,867 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-10-01 00:40:48,868 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:48,868 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:48,868 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-10-01 00:40:48,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:48,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:48,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:48,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:48,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:49,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:49,034 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:49,034 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) [2018-10-01 00:40:49,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:40:49,071 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:49,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:49,205 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:49,226 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:49,226 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:40:49,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:40:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:40:49,227 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:49,227 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-10-01 00:40:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:49,535 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 00:40:49,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:40:49,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-10-01 00:40:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:49,537 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:40:49,537 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:40:49,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:40:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:40:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:40:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:40:49,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:40:49,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-10-01 00:40:49,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:49,545 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:40:49,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:40:49,545 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:40:49,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:40:49,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:49,546 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-10-01 00:40:49,546 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:49,547 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:49,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-10-01 00:40:49,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:49,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:49,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:49,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:49,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:49,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:49,717 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-01 00:40:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:49,773 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-01 00:40:49,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:49,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:49,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:49,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:40:49,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:40:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:40:49,865 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:49,866 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-10-01 00:40:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:50,159 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-01 00:40:50,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:40:50,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-10-01 00:40:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:50,162 INFO L225 Difference]: With dead ends: 15 [2018-10-01 00:40:50,162 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:40:50,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:40:50,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:40:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:40:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:40:50,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 00:40:50,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-01 00:40:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:50,169 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 00:40:50,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:40:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 00:40:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:40:50,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:50,170 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-10-01 00:40:50,170 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:50,170 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-10-01 00:40:50,170 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:50,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:50,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:50,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:50,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:50,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:50,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:50,334 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-01 00:40:50,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:50,356 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:50,356 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:50,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:50,513 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:50,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:50,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:40:50,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:40:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:40:50,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:50,550 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-10-01 00:40:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:50,998 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-01 00:40:50,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:40:50,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-10-01 00:40:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:51,000 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:40:51,001 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 00:40:51,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:40:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 00:40:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 00:40:51,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:40:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 00:40:51,006 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-01 00:40:51,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:51,007 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-01 00:40:51,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:40:51,007 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 00:40:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:40:51,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:51,008 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-10-01 00:40:51,008 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:51,008 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:51,008 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-10-01 00:40:51,009 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:51,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:51,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:51,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:51,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:51,375 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:51,375 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-01 00:40:51,384 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:51,414 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-10-01 00:40:51,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:51,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:51,519 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:51,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:51,546 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:40:51,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:40:51,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:40:51,547 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:51,547 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-10-01 00:40:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:51,860 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-01 00:40:51,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:40:51,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-10-01 00:40:51,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:51,862 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:40:51,862 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 00:40:51,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:40:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 00:40:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-01 00:40:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:40:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:40:51,867 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-01 00:40:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:51,868 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:40:51,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:40:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:40:51,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:40:51,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:51,869 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-10-01 00:40:51,869 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:51,869 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:51,870 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-10-01 00:40:51,870 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:51,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:51,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:51,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:51,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:52,017 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:52,018 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-01 00:40:52,033 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:40:52,101 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:40:52,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:52,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:52,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:52,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:40:52,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:40:52,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:40:52,184 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:52,184 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-10-01 00:40:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:52,689 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-01 00:40:52,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:40:52,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-10-01 00:40:52,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:52,694 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:40:52,694 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:40:52,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:40:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:40:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:40:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:40:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 00:40:52,699 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-01 00:40:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:52,699 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-01 00:40:52,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:40:52,699 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 00:40:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:40:52,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:52,700 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-10-01 00:40:52,701 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:52,701 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:52,701 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-10-01 00:40:52,701 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:52,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:53,201 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:53,201 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-01 00:40:53,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:53,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:53,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:53,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:40:53,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:40:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:40:53,309 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:53,310 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-10-01 00:40:53,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:53,690 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-01 00:40:53,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:40:53,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-10-01 00:40:53,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:53,691 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:40:53,691 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:40:53,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:53,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:40:53,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:40:53,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:40:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:40:53,696 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-01 00:40:53,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:53,697 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:40:53,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:40:53,697 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:40:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:40:53,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:53,698 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-10-01 00:40:53,698 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:53,698 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:53,699 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-10-01 00:40:53,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:53,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:53,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:53,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:40:53,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:54,209 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:54,210 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:54,210 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-01 00:40:54,221 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:40:54,234 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:40:54,234 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:54,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:54,298 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:54,318 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:54,319 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:40:54,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:40:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:40:54,320 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:54,320 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-10-01 00:40:54,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:54,803 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-01 00:40:54,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:40:54,804 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-10-01 00:40:54,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:54,805 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:40:54,805 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:40:54,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:40:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:40:54,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:40:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:40:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 00:40:54,812 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-01 00:40:54,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:54,812 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-01 00:40:54,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:40:54,812 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 00:40:54,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:40:54,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:54,813 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-10-01 00:40:54,814 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:54,814 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:54,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-10-01 00:40:54,814 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:54,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:54,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:54,992 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:54,992 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:54,993 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-01 00:40:55,006 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:40:55,891 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-10-01 00:40:55,891 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:55,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:55,958 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:55,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:55,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:40:55,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:40:55,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:40:55,979 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:55,979 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-10-01 00:40:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:56,541 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-01 00:40:56,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:40:56,542 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-10-01 00:40:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:56,543 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:40:56,543 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:40:56,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:40:56,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:40:56,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:40:56,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:40:56,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 00:40:56,549 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-01 00:40:56,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:56,549 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 00:40:56,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:40:56,549 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 00:40:56,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:40:56,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:56,550 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-10-01 00:40:56,550 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:56,550 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:56,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-10-01 00:40:56,551 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:56,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:56,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:56,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:56,773 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:56,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:56,774 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-01 00:40:56,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:40:56,803 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:40:56,803 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:56,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:57,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:57,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:40:57,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:40:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:40:57,027 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:57,027 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-10-01 00:40:58,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:58,003 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-01 00:40:58,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:40:58,004 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-10-01 00:40:58,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:58,005 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:40:58,005 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:40:58,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:40:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:40:58,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:40:58,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:40:58,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 00:40:58,011 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-01 00:40:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:58,012 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 00:40:58,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:40:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 00:40:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:40:58,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:58,013 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-10-01 00:40:58,013 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:58,013 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-10-01 00:40:58,013 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:58,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:58,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:58,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:58,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:40:58,560 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:58,560 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:40:58,561 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-01 00:40:58,570 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:40:58,695 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-10-01 00:40:58,696 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:40:58,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:40:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:40:58,957 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:40:58,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:40:58,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:40:58,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:40:58,959 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:40:58,959 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-10-01 00:40:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:40:59,699 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 00:40:59,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:40:59,699 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-10-01 00:40:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:40:59,700 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:40:59,700 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:40:59,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:40:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:40:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:40:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:40:59,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 00:40:59,706 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-01 00:40:59,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:40:59,706 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 00:40:59,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:40:59,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 00:40:59,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:40:59,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:40:59,707 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-10-01 00:40:59,707 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:40:59,707 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:40:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-10-01 00:40:59,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:40:59,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:40:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:59,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:40:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:40:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:01,049 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:01,049 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:01,049 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-01 00:41:01,057 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:02,111 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:41:02,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:02,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:02,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:02,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:41:02,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:41:02,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:41:02,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:02,263 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-10-01 00:41:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:03,076 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-01 00:41:03,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:41:03,077 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-10-01 00:41:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:03,078 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:41:03,078 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:41:03,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:41:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:41:03,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:41:03,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:41:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 00:41:03,084 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-01 00:41:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:03,084 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 00:41:03,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:41:03,084 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 00:41:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:41:03,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:03,085 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-10-01 00:41:03,085 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:03,086 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:03,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-10-01 00:41:03,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:03,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:03,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:03,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:03,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:03,510 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:03,511 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-01 00:41:03,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:03,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:03,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:03,747 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:41:03,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:41:03,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:41:03,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:03,747 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-10-01 00:41:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:04,828 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 00:41:04,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:41:04,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-10-01 00:41:04,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:04,830 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:41:04,830 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:41:04,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:41:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:41:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:41:04,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:41:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 00:41:04,838 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-01 00:41:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:04,838 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 00:41:04,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:41:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 00:41:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:41:04,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:04,839 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-10-01 00:41:04,839 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:04,839 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-10-01 00:41:04,840 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:04,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:04,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:04,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:05,495 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:05,495 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-01 00:41:05,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:05,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:05,528 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:05,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:06,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:06,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:41:06,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:41:06,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:41:06,125 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:06,125 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-10-01 00:41:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:07,202 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-01 00:41:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:41:07,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-10-01 00:41:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:07,203 INFO L225 Difference]: With dead ends: 37 [2018-10-01 00:41:07,203 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:41:07,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:41:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:41:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:41:07,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:41:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 00:41:07,209 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-01 00:41:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:07,209 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-01 00:41:07,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:41:07,209 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 00:41:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:41:07,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:07,210 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-10-01 00:41:07,210 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:07,210 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-10-01 00:41:07,211 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:07,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:07,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:07,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:07,823 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:07,823 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-01 00:41:07,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:09,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-10-01 00:41:09,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:09,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:09,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:09,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:41:09,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:41:09,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:41:09,170 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:09,170 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-10-01 00:41:10,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:10,278 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-01 00:41:10,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:41:10,279 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-10-01 00:41:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:10,280 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:41:10,280 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:41:10,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:41:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:41:10,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:41:10,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:41:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:41:10,285 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-01 00:41:10,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:10,285 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:41:10,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:41:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:41:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:41:10,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:10,287 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-10-01 00:41:10,287 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:10,287 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-10-01 00:41:10,287 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:10,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:10,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:10,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:10,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:10,658 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:10,658 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:10,658 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:41:10,665 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:10,698 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:10,699 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:10,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:10,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:10,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:41:10,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:41:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:41:10,860 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:10,860 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-10-01 00:41:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:12,210 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-01 00:41:12,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:41:12,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-10-01 00:41:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:12,211 INFO L225 Difference]: With dead ends: 41 [2018-10-01 00:41:12,211 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:41:12,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:41:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:41:12,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 00:41:12,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:41:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-01 00:41:12,218 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-01 00:41:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:12,219 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-01 00:41:12,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:41:12,219 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-01 00:41:12,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:41:12,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:12,220 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-10-01 00:41:12,220 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:12,221 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:12,221 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-10-01 00:41:12,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:12,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:12,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:12,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:12,654 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:12,654 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:12,654 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-01 00:41:12,662 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:41:42,299 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-10-01 00:41:42,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:42,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:42,532 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:42,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:42,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:41:42,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:41:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:41:42,553 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:42,553 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-10-01 00:41:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:44,074 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-01 00:41:44,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:41:44,074 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-10-01 00:41:44,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:44,075 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:41:44,075 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:41:44,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:41:44,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:41:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:41:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:41:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 00:41:44,082 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-01 00:41:44,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:44,082 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 00:41:44,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:41:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 00:41:44,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:41:44,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:44,083 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-10-01 00:41:44,084 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:44,084 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-10-01 00:41:44,084 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:44,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:44,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:44,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:44,887 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:44,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 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-01 00:41:44,896 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:41:45,991 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:41:45,991 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:45,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:46,200 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:46,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:46,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:41:46,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:41:46,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:41:46,225 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:46,225 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-10-01 00:41:48,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:48,092 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-01 00:41:48,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:41:48,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-10-01 00:41:48,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:48,093 INFO L225 Difference]: With dead ends: 45 [2018-10-01 00:41:48,093 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:41:48,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:41:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:41:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 00:41:48,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 00:41:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-01 00:41:48,098 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-01 00:41:48,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:48,098 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-01 00:41:48,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:41:48,098 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-01 00:41:48,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:41:48,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:48,099 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-10-01 00:41:48,099 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:48,099 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:48,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-10-01 00:41:48,099 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:48,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:48,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:48,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:48,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:49,042 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:49,043 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:49,043 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-01 00:41:49,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:49,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:49,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:49,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:49,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:41:49,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:41:49,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:41:49,174 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:49,174 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-10-01 00:41:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:50,885 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-01 00:41:50,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:41:50,886 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-10-01 00:41:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:50,887 INFO L225 Difference]: With dead ends: 47 [2018-10-01 00:41:50,887 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 00:41:50,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:41:50,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 00:41:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-01 00:41:50,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 00:41:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 00:41:50,895 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-01 00:41:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:50,895 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-01 00:41:50,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:41:50,896 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 00:41:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 00:41:50,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:50,897 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-10-01 00:41:50,897 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:50,897 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-10-01 00:41:50,897 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:50,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:50,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:50,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:41:50,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:51,313 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:51,313 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:51,314 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-01 00:41:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:41:51,348 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:41:51,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:51,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:51,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:51,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:51,448 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:41:51,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:41:51,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:41:51,448 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:51,449 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-10-01 00:41:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:53,299 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-01 00:41:53,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:41:53,306 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-10-01 00:41:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:53,306 INFO L225 Difference]: With dead ends: 49 [2018-10-01 00:41:53,306 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 00:41:53,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:41:53,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 00:41:53,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 00:41:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 00:41:53,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 00:41:53,312 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-01 00:41:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:53,313 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-01 00:41:53,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:41:53,313 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 00:41:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 00:41:53,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:53,314 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-10-01 00:41:53,314 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:53,314 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:53,314 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-10-01 00:41:53,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:53,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:53,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:53,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:53,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:53,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:53,699 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-01 00:41:53,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:41:56,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-10-01 00:41:56,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:56,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:56,195 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:56,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:56,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:41:56,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:41:56,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:41:56,216 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:56,216 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-10-01 00:41:58,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:41:58,305 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-01 00:41:58,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:41:58,308 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-10-01 00:41:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:41:58,309 INFO L225 Difference]: With dead ends: 51 [2018-10-01 00:41:58,309 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 00:41:58,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:41:58,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 00:41:58,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-01 00:41:58,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 00:41:58,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 00:41:58,314 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-01 00:41:58,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:41:58,314 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-01 00:41:58,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:41:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 00:41:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 00:41:58,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:41:58,315 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-10-01 00:41:58,316 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:41:58,316 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:41:58,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-10-01 00:41:58,316 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:41:58,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:41:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:58,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:41:58,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:41:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:41:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:58,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:41:58,729 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-01 00:41:58,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:41:58,759 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:41:58,759 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:41:58,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:41:58,841 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:41:58,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:41:58,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-01 00:41:58,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:41:58,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:41:58,863 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:41:58,863 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-10-01 00:42:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:42:00,980 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-01 00:42:00,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:42:00,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-10-01 00:42:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:42:00,981 INFO L225 Difference]: With dead ends: 53 [2018-10-01 00:42:00,982 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 00:42:00,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:42:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 00:42:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 00:42:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 00:42:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 00:42:00,988 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-01 00:42:00,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:42:00,988 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-01 00:42:00,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:42:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 00:42:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 00:42:00,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:42:00,989 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-10-01 00:42:00,990 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:42:00,990 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:42:00,990 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-10-01 00:42:00,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:42:00,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:42:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:00,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:42:00,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:42:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:42:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:42:01,636 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:42:01,636 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-01 00:42:01,643 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:43:35,959 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-10-01 00:43:35,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:43:36,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:43:36,846 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:36,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:43:36,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:43:36,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:43:36,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:43:36,868 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:43:36,868 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-10-01 00:43:39,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:43:39,115 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-01 00:43:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:43:39,115 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-10-01 00:43:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:43:39,116 INFO L225 Difference]: With dead ends: 55 [2018-10-01 00:43:39,116 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 00:43:39,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:43:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 00:43:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 00:43:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 00:43:39,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 00:43:39,122 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-01 00:43:39,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:43:39,122 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-01 00:43:39,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:43:39,122 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 00:43:39,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 00:43:39,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:43:39,122 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-10-01 00:43:39,123 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:43:39,123 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:43:39,123 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-10-01 00:43:39,123 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:43:39,123 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:43:39,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:39,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:43:39,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:43:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:43:40,609 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:43:40,609 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:43:40,610 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:43:40,618 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:44:19,533 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 00:44:19,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:19,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:19,708 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:19,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:44:19,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:44:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:44:19,708 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:19,709 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-10-01 00:44:22,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:22,306 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-01 00:44:22,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:44:22,306 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-10-01 00:44:22,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:22,307 INFO L225 Difference]: With dead ends: 57 [2018-10-01 00:44:22,307 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 00:44:22,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:44:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 00:44:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 00:44:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 00:44:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-01 00:44:22,313 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-01 00:44:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:22,314 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-01 00:44:22,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:44:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-01 00:44:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 00:44:22,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:22,315 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-10-01 00:44:22,315 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:22,315 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-10-01 00:44:22,315 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:22,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:22,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:22,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:23,114 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:23,115 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:23,115 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-01 00:44:23,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:23,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:23,260 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:23,281 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:23,282 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-01 00:44:23,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:44:23,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:44:23,282 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:23,282 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-10-01 00:44:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:25,998 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-01 00:44:25,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:44:25,998 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-10-01 00:44:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:25,999 INFO L225 Difference]: With dead ends: 59 [2018-10-01 00:44:25,999 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 00:44:26,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:44:26,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 00:44:26,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-01 00:44:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 00:44:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 00:44:26,004 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-01 00:44:26,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:26,004 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-01 00:44:26,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:44:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 00:44:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 00:44:26,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:26,005 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-10-01 00:44:26,005 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:26,005 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-10-01 00:44:26,006 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:26,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:26,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:26,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:44:26,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:26,570 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:26,570 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-01 00:44:26,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:44:26,606 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:44:26,606 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:26,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:26,785 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:26,806 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:26,806 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:44:26,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:44:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:44:26,807 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:26,807 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-10-01 00:44:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:29,616 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-01 00:44:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:44:29,617 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-10-01 00:44:29,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:29,618 INFO L225 Difference]: With dead ends: 61 [2018-10-01 00:44:29,618 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 00:44:29,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:44:29,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 00:44:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 00:44:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 00:44:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-01 00:44:29,622 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-01 00:44:29,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:29,622 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-01 00:44:29,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:44:29,622 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-01 00:44:29,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 00:44:29,626 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:29,626 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-10-01 00:44:29,626 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:29,626 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:29,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-10-01 00:44:29,627 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:29,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:29,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:29,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:29,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:30,203 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:30,203 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:30,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 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-01 00:44:30,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:44:48,344 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-10-01 00:44:48,344 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:48,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:48,547 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:48,547 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:44:48,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:44:48,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:44:48,548 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:48,548 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-10-01 00:44:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:51,661 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-01 00:44:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:44:51,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-10-01 00:44:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:51,663 INFO L225 Difference]: With dead ends: 63 [2018-10-01 00:44:51,663 INFO L226 Difference]: Without dead ends: 61 [2018-10-01 00:44:51,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:44:51,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-01 00:44:51,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-01 00:44:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 00:44:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 00:44:51,667 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-01 00:44:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:51,667 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-01 00:44:51,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:44:51,667 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 00:44:51,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 00:44:51,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:51,668 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-10-01 00:44:51,668 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:51,668 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:51,668 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-10-01 00:44:51,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:51,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:51,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:51,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:52,409 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:52,409 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-01 00:44:52,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:44:52,457 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:44:52,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:44:52,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:44:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:52,601 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:44:52,601 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:44:52,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:44:52,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:44:52,602 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:44:52,602 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-10-01 00:44:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:44:55,808 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-01 00:44:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:44:55,808 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-10-01 00:44:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:44:55,809 INFO L225 Difference]: With dead ends: 65 [2018-10-01 00:44:55,809 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 00:44:55,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s Time [2018-10-01 00:44:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 00:44:55,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-01 00:44:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 00:44:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-01 00:44:55,814 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-01 00:44:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:44:55,814 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-01 00:44:55,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:44:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-01 00:44:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 00:44:55,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:44:55,815 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-10-01 00:44:55,815 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:44:55,815 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:44:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-10-01 00:44:55,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:44:55,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:44:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:55,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:44:55,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:44:55,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:44:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:44:56,650 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:44:56,651 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-01 00:44:56,658 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:47:40,486 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-10-01 00:47:40,486 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:47:40,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:47:40,812 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:40,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:47:40,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:47:40,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:47:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:47:40,818 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:47:40,819 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-10-01 00:47:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:47:44,333 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-01 00:47:44,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:47:44,333 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-10-01 00:47:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:47:44,334 INFO L225 Difference]: With dead ends: 67 [2018-10-01 00:47:44,334 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 00:47:44,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:47:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 00:47:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-01 00:47:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 00:47:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-01 00:47:44,339 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-01 00:47:44,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:47:44,339 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-01 00:47:44,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:47:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-01 00:47:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 00:47:44,340 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:47:44,340 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-10-01 00:47:44,340 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:47:44,340 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:47:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-10-01 00:47:44,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:47:44,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:47:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:44,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:47:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:47:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:47:45,640 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:47:45,640 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:47:45,640 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-01 00:47:45,649 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:48:55,260 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 00:48:55,261 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:48:55,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:48:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:48:55,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:48:55,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:48:55,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:48:55,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:48:55,479 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:48:55,479 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-10-01 00:48:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:48:59,292 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-01 00:48:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:48:59,293 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-10-01 00:48:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:48:59,294 INFO L225 Difference]: With dead ends: 69 [2018-10-01 00:48:59,294 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 00:48:59,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 00:48:59,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 00:48:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-01 00:48:59,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 00:48:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-01 00:48:59,300 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-01 00:48:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:48:59,300 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-01 00:48:59,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:48:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-01 00:48:59,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 00:48:59,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:48:59,301 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-10-01 00:48:59,301 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:48:59,301 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:48:59,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-10-01 00:48:59,302 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:48:59,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:48:59,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:59,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:48:59,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:48:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:00,166 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:00,166 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-01 00:49:00,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:49:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:00,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:00,490 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:00,510 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:00,510 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-01 00:49:00,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:49:00,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:49:00,511 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:00,511 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-10-01 00:49:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:04,573 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-01 00:49:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:49:04,573 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-10-01 00:49:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:04,574 INFO L225 Difference]: With dead ends: 71 [2018-10-01 00:49:04,574 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 00:49:04,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:49:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 00:49:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-01 00:49:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 00:49:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-01 00:49:04,581 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-01 00:49:04,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:04,581 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-01 00:49:04,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:49:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-01 00:49:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 00:49:04,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:04,582 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-10-01 00:49:04,582 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:04,582 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-10-01 00:49:04,582 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:04,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:04,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:04,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:49:04,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:05,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:05,529 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:05,529 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-01 00:49:05,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:49:05,577 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:49:05,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:49:05,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:49:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:05,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:49:05,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:49:05,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:49:05,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:49:05,743 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:49:05,743 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-10-01 00:49:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:49:09,985 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-01 00:49:09,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:49:09,985 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-10-01 00:49:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:49:09,986 INFO L225 Difference]: With dead ends: 73 [2018-10-01 00:49:09,986 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 00:49:09,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:49:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 00:49:09,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-01 00:49:09,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 00:49:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-01 00:49:09,992 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-01 00:49:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:49:09,993 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-01 00:49:09,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:49:09,993 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-01 00:49:09,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 00:49:09,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:49:09,994 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-10-01 00:49:09,994 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:49:09,994 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:49:09,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-10-01 00:49:09,994 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:49:09,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:49:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:09,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:49:09,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:49:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:49:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:49:10,914 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:49:10,914 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-01 00:49:10,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:52:39,646 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-10-01 00:52:39,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:40,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:40,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:40,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:40,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:52:40,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:52:40,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:52:40,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:40,496 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-10-01 00:52:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:45,036 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-01 00:52:45,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:52:45,037 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-10-01 00:52:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:45,038 INFO L225 Difference]: With dead ends: 75 [2018-10-01 00:52:45,038 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 00:52:45,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:52:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 00:52:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-01 00:52:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 00:52:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-01 00:52:45,044 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-01 00:52:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:45,044 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-01 00:52:45,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:52:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-01 00:52:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 00:52:45,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:45,045 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-10-01 00:52:45,045 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:45,045 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-10-01 00:52:45,046 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:45,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:45,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:45,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:45,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:45,983 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:45,983 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-01 00:52:45,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:52:46,024 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:52:46,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:52:46,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:52:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:46,186 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:52:46,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:52:46,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:52:46,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:52:46,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:52:46,187 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-10-01 00:52:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:52:50,956 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-01 00:52:50,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:52:50,957 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-10-01 00:52:50,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:52:50,958 INFO L225 Difference]: With dead ends: 77 [2018-10-01 00:52:50,958 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 00:52:50,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:52:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 00:52:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-01 00:52:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 00:52:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-01 00:52:50,963 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-01 00:52:50,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:52:50,964 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-01 00:52:50,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:52:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-01 00:52:50,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 00:52:50,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:52:50,964 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-10-01 00:52:50,965 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:52:50,965 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:52:50,965 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-10-01 00:52:50,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:52:50,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:52:50,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:50,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:52:50,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:52:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:52:51,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:52:51,964 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:52:51,964 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-01 00:52:51,973 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown