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/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-00a8621 [2018-09-30 10:57:31,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 10:57:31,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 10:57:31,213 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 10:57:31,213 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 10:57:31,214 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 10:57:31,215 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 10:57:31,217 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 10:57:31,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 10:57:31,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 10:57:31,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 10:57:31,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 10:57:31,222 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 10:57:31,223 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 10:57:31,224 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 10:57:31,225 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 10:57:31,226 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 10:57:31,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 10:57:31,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 10:57:31,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 10:57:31,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 10:57:31,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 10:57:31,236 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 10:57:31,236 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 10:57:31,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 10:57:31,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 10:57:31,239 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 10:57:31,240 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 10:57:31,240 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 10:57:31,242 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 10:57:31,242 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 10:57:31,243 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 10:57:31,243 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 10:57:31,243 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 10:57:31,244 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 10:57:31,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 10:57:31,245 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-09-30 10:57:31,262 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 10:57:31,263 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 10:57:31,264 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 10:57:31,264 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 10:57:31,264 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 10:57:31,264 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 10:57:31,265 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 10:57:31,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 10:57:31,265 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 10:57:31,265 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 10:57:31,265 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 10:57:31,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 10:57:31,266 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 10:57:31,266 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 10:57:31,266 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 10:57:31,266 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 10:57:31,267 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 10:57:31,267 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 10:57:31,267 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 10:57:31,267 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 10:57:31,267 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 10:57:31,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 10:57:31,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 10:57:31,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 10:57:31,268 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 10:57:31,268 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 10:57:31,268 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 10:57:31,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 10:57:31,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 10:57:31,269 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 10:57:31,269 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-30 10:57:31,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 10:57:31,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 10:57:31,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 10:57:31,329 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 10:57:31,330 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 10:57:31,331 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl [2018-09-30 10:57:31,331 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEquality-Safe.bpl' [2018-09-30 10:57:31,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 10:57:31,379 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 10:57:31,380 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 10:57:31,380 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 10:57:31,380 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 10:57:31,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,413 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,418 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-30 10:57:31,418 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-30 10:57:31,419 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-30 10:57:31,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 10:57:31,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 10:57:31,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 10:57:31,422 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 10:57:31,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/1) ... [2018-09-30 10:57:31,442 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 10:57:31,442 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 10:57:31,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 10:57:31,443 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 10:57:31,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (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-09-30 10:57:31,508 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-30 10:57:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-30 10:57:31,508 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-30 10:57:31,700 INFO L345 CfgBuilder]: Using library mode [2018-09-30 10:57:31,701 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:57:31 BoogieIcfgContainer [2018-09-30 10:57:31,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 10:57:31,703 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 10:57:31,703 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 10:57:31,709 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 10:57:31,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 10:57:31" (1/2) ... [2018-09-30 10:57:31,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a27b009 and model type HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 10:57:31, skipping insertion in model container [2018-09-30 10:57:31,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 10:57:31" (2/2) ... [2018-09-30 10:57:31,713 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEquality-Safe.bpl [2018-09-30 10:57:31,723 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 10:57:31,733 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 10:57:31,796 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 10:57:31,797 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 10:57:31,797 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 10:57:31,797 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 10:57:31,797 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 10:57:31,797 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 10:57:31,798 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 10:57:31,798 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 10:57:31,798 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 10:57:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-30 10:57:31,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-09-30 10:57:31,826 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:31,828 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-09-30 10:57:31,829 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:31,840 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-09-30 10:57:31,842 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:31,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:31,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:31,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:31,987 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 10:57:31,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-30 10:57:31,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-30 10:57:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-30 10:57:32,004 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:32,006 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-30 10:57:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:32,203 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-30 10:57:32,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-30 10:57:32,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-09-30 10:57:32,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:32,216 INFO L225 Difference]: With dead ends: 9 [2018-09-30 10:57:32,217 INFO L226 Difference]: Without dead ends: 4 [2018-09-30 10:57:32,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:32,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-09-30 10:57:32,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-09-30 10:57:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-09-30 10:57:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-09-30 10:57:32,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-09-30 10:57:32,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:32,254 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-09-30 10:57:32,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-30 10:57:32,254 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-09-30 10:57:32,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-30 10:57:32,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:32,254 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-30 10:57:32,255 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:32,255 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:32,255 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-09-30 10:57:32,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:32,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:32,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:32,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:32,346 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:32,346 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-09-30 10:57:32,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:32,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:32,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:32,506 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:32,506 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-09-30 10:57:32,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 10:57:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 10:57:32,508 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:32,508 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-09-30 10:57:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:32,771 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-09-30 10:57:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 10:57:32,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-09-30 10:57:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:32,772 INFO L225 Difference]: With dead ends: 6 [2018-09-30 10:57:32,772 INFO L226 Difference]: Without dead ends: 5 [2018-09-30 10:57:32,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-30 10:57:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-30 10:57:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-30 10:57:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-30 10:57:32,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-30 10:57:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:32,776 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-30 10:57:32,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 10:57:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-30 10:57:32,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-30 10:57:32,777 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:32,777 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-09-30 10:57:32,777 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:32,777 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:32,778 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-09-30 10:57:32,778 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:32,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:32,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:32,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:32,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:32,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:32,865 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:32,866 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:32,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:32,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:32,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-09-30 10:57:32,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 10:57:32,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 10:57:32,907 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:32,907 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-09-30 10:57:33,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:33,118 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-09-30 10:57:33,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-30 10:57:33,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-09-30 10:57:33,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:33,119 INFO L225 Difference]: With dead ends: 7 [2018-09-30 10:57:33,119 INFO L226 Difference]: Without dead ends: 6 [2018-09-30 10:57:33,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:33,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-30 10:57:33,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-30 10:57:33,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-30 10:57:33,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-30 10:57:33,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-30 10:57:33,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:33,123 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-30 10:57:33,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 10:57:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-30 10:57:33,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-30 10:57:33,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:33,124 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-09-30 10:57:33,124 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:33,124 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-09-30 10:57:33,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:33,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:33,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:33,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:33,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:33,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:33,320 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-09-30 10:57:33,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:33,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 10:57:33,343 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:33,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:33,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:33,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-30 10:57:33,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 10:57:33,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 10:57:33,402 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:33,402 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-09-30 10:57:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:33,510 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-30 10:57:33,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 10:57:33,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-09-30 10:57:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:33,511 INFO L225 Difference]: With dead ends: 8 [2018-09-30 10:57:33,512 INFO L226 Difference]: Without dead ends: 7 [2018-09-30 10:57:33,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:33,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-30 10:57:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-30 10:57:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-30 10:57:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-30 10:57:33,516 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-30 10:57:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:33,516 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-30 10:57:33,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 10:57:33,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-30 10:57:33,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 10:57:33,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:33,517 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-09-30 10:57:33,517 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:33,518 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:33,518 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-09-30 10:57:33,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:33,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:33,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:33,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:33,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:33,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:33,598 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:33,598 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-09-30 10:57:33,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:33,614 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:33,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:33,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:33,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:33,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:33,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-09-30 10:57:33,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-30 10:57:33,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-30 10:57:33,752 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:33,752 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-09-30 10:57:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:33,824 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-30 10:57:33,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-30 10:57:33,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-09-30 10:57:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:33,826 INFO L225 Difference]: With dead ends: 9 [2018-09-30 10:57:33,826 INFO L226 Difference]: Without dead ends: 8 [2018-09-30 10:57:33,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:33,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-30 10:57:33,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-30 10:57:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-30 10:57:33,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-30 10:57:33,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-30 10:57:33,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:33,830 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-30 10:57:33,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-30 10:57:33,830 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-30 10:57:33,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-30 10:57:33,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:33,831 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-09-30 10:57:33,831 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:33,831 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:33,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-09-30 10:57:33,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:33,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:33,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:33,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:33,913 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:33,913 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-09-30 10:57:33,925 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:33,937 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 10:57:33,937 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:33,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:33,989 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:33,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-09-30 10:57:33,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-30 10:57:33,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-30 10:57:33,990 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:33,990 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-09-30 10:57:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:34,347 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-30 10:57:34,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 10:57:34,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-09-30 10:57:34,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:34,349 INFO L225 Difference]: With dead ends: 10 [2018-09-30 10:57:34,349 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 10:57:34,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:34,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 10:57:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 10:57:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 10:57:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-30 10:57:34,352 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-30 10:57:34,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:34,353 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-30 10:57:34,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-30 10:57:34,353 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-30 10:57:34,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 10:57:34,353 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:34,354 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-09-30 10:57:34,354 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:34,354 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:34,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-09-30 10:57:34,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:34,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:34,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:34,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:34,744 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:34,744 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 10:57:34,753 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:34,805 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-09-30 10:57:34,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:34,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:34,887 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:34,888 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-09-30 10:57:34,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 10:57:34,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 10:57:34,888 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:34,889 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-09-30 10:57:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:35,000 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-30 10:57:35,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 10:57:35,000 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-09-30 10:57:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:35,001 INFO L225 Difference]: With dead ends: 11 [2018-09-30 10:57:35,001 INFO L226 Difference]: Without dead ends: 10 [2018-09-30 10:57:35,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-30 10:57:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-30 10:57:35,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-30 10:57:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-30 10:57:35,005 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-30 10:57:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:35,005 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-30 10:57:35,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 10:57:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-30 10:57:35,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-30 10:57:35,006 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:35,006 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-09-30 10:57:35,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:35,007 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:35,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-09-30 10:57:35,007 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:35,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:35,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:35,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:35,109 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:35,109 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:35,109 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-09-30 10:57:35,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:35,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:35,160 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:35,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:35,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-09-30 10:57:35,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 10:57:35,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 10:57:35,182 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:35,182 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-09-30 10:57:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:35,258 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-30 10:57:35,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-30 10:57:35,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-09-30 10:57:35,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:35,259 INFO L225 Difference]: With dead ends: 12 [2018-09-30 10:57:35,260 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 10:57:35,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:35,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 10:57:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 10:57:35,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 10:57:35,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-30 10:57:35,264 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-30 10:57:35,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:35,265 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-30 10:57:35,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 10:57:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-30 10:57:35,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 10:57:35,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:35,266 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-09-30 10:57:35,266 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:35,266 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-09-30 10:57:35,267 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:35,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:35,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:35,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:35,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:35,399 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:35,400 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:35,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 10:57:35,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:35,423 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:35,424 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:35,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:35,476 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:35,497 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:35,497 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-09-30 10:57:35,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-30 10:57:35,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-30 10:57:35,498 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:35,498 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-09-30 10:57:35,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:35,796 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-30 10:57:35,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 10:57:35,797 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-09-30 10:57:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:35,798 INFO L225 Difference]: With dead ends: 13 [2018-09-30 10:57:35,798 INFO L226 Difference]: Without dead ends: 12 [2018-09-30 10:57:35,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:35,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-30 10:57:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-30 10:57:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-30 10:57:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-30 10:57:35,801 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-30 10:57:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:35,801 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-30 10:57:35,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-30 10:57:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-30 10:57:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-30 10:57:35,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:35,802 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-09-30 10:57:35,802 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:35,802 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-09-30 10:57:35,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:35,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:35,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:35,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:35,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:35,902 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:35,902 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-09-30 10:57:35,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:35,924 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 10:57:35,925 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:35,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:36,017 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:36,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:36,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-09-30 10:57:36,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-30 10:57:36,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-30 10:57:36,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:36,041 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-09-30 10:57:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:36,130 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-30 10:57:36,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-30 10:57:36,130 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-09-30 10:57:36,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:36,131 INFO L225 Difference]: With dead ends: 14 [2018-09-30 10:57:36,131 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 10:57:36,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:36,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 10:57:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 10:57:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 10:57:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-30 10:57:36,136 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-30 10:57:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:36,136 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-30 10:57:36,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-30 10:57:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-30 10:57:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 10:57:36,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:36,137 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-09-30 10:57:36,137 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:36,138 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:36,138 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-09-30 10:57:36,138 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:36,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:36,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:36,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:36,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:36,224 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:36,225 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:36,225 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-09-30 10:57:36,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:36,245 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:36,245 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:36,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:36,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:36,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-09-30 10:57:36,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 10:57:36,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 10:57:36,315 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:36,315 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-09-30 10:57:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:36,403 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-30 10:57:36,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-30 10:57:36,403 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-09-30 10:57:36,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:36,405 INFO L225 Difference]: With dead ends: 15 [2018-09-30 10:57:36,405 INFO L226 Difference]: Without dead ends: 14 [2018-09-30 10:57:36,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:36,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-30 10:57:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-30 10:57:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-30 10:57:36,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-30 10:57:36,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-30 10:57:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:36,409 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-30 10:57:36,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 10:57:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-30 10:57:36,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-30 10:57:36,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:36,410 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-09-30 10:57:36,410 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:36,411 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-09-30 10:57:36,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:36,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:36,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:36,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:36,519 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:36,520 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:36,520 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-09-30 10:57:36,533 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:36,568 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-30 10:57:36,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:36,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:36,615 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:36,636 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:36,636 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-09-30 10:57:36,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-30 10:57:36,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-30 10:57:36,637 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:36,637 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-09-30 10:57:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:36,723 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-30 10:57:36,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 10:57:36,723 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-09-30 10:57:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:36,725 INFO L225 Difference]: With dead ends: 16 [2018-09-30 10:57:36,725 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 10:57:36,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 10:57:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 10:57:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 10:57:36,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-30 10:57:36,728 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-30 10:57:36,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:36,729 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-30 10:57:36,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-30 10:57:36,729 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-30 10:57:36,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 10:57:36,730 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:36,730 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-09-30 10:57:36,730 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:36,730 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:36,730 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-09-30 10:57:36,731 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:36,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:36,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:36,902 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:36,902 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-09-30 10:57:36,910 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:36,923 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-30 10:57:36,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:36,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:36,964 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:36,987 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:36,987 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-09-30 10:57:36,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-30 10:57:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-30 10:57:36,987 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:36,988 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-09-30 10:57:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:37,124 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-30 10:57:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 10:57:37,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-09-30 10:57:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:37,125 INFO L225 Difference]: With dead ends: 17 [2018-09-30 10:57:37,126 INFO L226 Difference]: Without dead ends: 16 [2018-09-30 10:57:37,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-30 10:57:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-30 10:57:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-30 10:57:37,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-30 10:57:37,130 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-30 10:57:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:37,130 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-30 10:57:37,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-30 10:57:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-30 10:57:37,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-30 10:57:37,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:37,131 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-09-30 10:57:37,131 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:37,132 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:37,132 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-09-30 10:57:37,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:37,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:37,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:37,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:37,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:37,247 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:37,248 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-09-30 10:57:37,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:37,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:37,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:37,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-09-30 10:57:37,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 10:57:37,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 10:57:37,378 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:37,378 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-09-30 10:57:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:37,474 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-30 10:57:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-30 10:57:37,475 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-09-30 10:57:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:37,476 INFO L225 Difference]: With dead ends: 18 [2018-09-30 10:57:37,476 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 10:57:37,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:37,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 10:57:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 10:57:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 10:57:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-30 10:57:37,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-30 10:57:37,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:37,481 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-30 10:57:37,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 10:57:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-30 10:57:37,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 10:57:37,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:37,482 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-09-30 10:57:37,482 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:37,483 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:37,483 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-09-30 10:57:37,483 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:37,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:37,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:37,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:37,634 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:37,634 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-09-30 10:57:37,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:37,662 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:37,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:37,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:37,802 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:37,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:37,823 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-09-30 10:57:37,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-30 10:57:37,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-30 10:57:37,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:37,824 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-09-30 10:57:38,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:38,160 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-30 10:57:38,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 10:57:38,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-09-30 10:57:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:38,160 INFO L225 Difference]: With dead ends: 19 [2018-09-30 10:57:38,160 INFO L226 Difference]: Without dead ends: 18 [2018-09-30 10:57:38,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-30 10:57:38,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-30 10:57:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-30 10:57:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-30 10:57:38,164 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-30 10:57:38,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:38,164 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-30 10:57:38,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-30 10:57:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-30 10:57:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-30 10:57:38,165 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:38,165 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-09-30 10:57:38,165 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:38,165 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-09-30 10:57:38,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:38,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:38,380 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:38,380 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:38,380 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-09-30 10:57:38,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:38,404 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-09-30 10:57:38,404 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:38,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:38,535 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:38,535 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-09-30 10:57:38,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 10:57:38,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 10:57:38,536 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:38,536 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-09-30 10:57:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:38,654 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-30 10:57:38,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 10:57:38,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-09-30 10:57:38,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:38,656 INFO L225 Difference]: With dead ends: 20 [2018-09-30 10:57:38,656 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 10:57:38,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:38,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 10:57:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 10:57:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 10:57:38,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-30 10:57:38,659 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-30 10:57:38,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:38,660 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-30 10:57:38,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 10:57:38,660 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-30 10:57:38,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 10:57:38,660 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:38,660 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-09-30 10:57:38,661 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:38,661 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:38,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-09-30 10:57:38,661 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:38,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:38,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:38,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:38,872 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 10:57:38,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:38,895 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:38,895 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:38,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:38,960 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:38,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-09-30 10:57:38,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 10:57:38,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 10:57:38,961 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:38,961 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-09-30 10:57:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:39,135 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-30 10:57:39,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-30 10:57:39,135 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-09-30 10:57:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:39,136 INFO L225 Difference]: With dead ends: 21 [2018-09-30 10:57:39,137 INFO L226 Difference]: Without dead ends: 20 [2018-09-30 10:57:39,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:39,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-30 10:57:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-30 10:57:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-30 10:57:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-30 10:57:39,141 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-30 10:57:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:39,142 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-30 10:57:39,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 10:57:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-30 10:57:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-30 10:57:39,142 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:39,142 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-09-30 10:57:39,143 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:39,143 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:39,143 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-09-30 10:57:39,143 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:39,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:39,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:39,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:39,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:39,655 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:39,655 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 10:57:39,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:39,701 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-09-30 10:57:39,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:39,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:39,851 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:39,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-09-30 10:57:39,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-30 10:57:39,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-30 10:57:39,852 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:39,852 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-09-30 10:57:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:40,179 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-30 10:57:40,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-30 10:57:40,180 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-09-30 10:57:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:40,180 INFO L225 Difference]: With dead ends: 22 [2018-09-30 10:57:40,181 INFO L226 Difference]: Without dead ends: 21 [2018-09-30 10:57:40,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-30 10:57:40,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-30 10:57:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-30 10:57:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-30 10:57:40,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-30 10:57:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:40,185 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-30 10:57:40,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-30 10:57:40,186 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-30 10:57:40,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-30 10:57:40,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:40,186 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-09-30 10:57:40,186 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:40,186 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:40,187 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-09-30 10:57:40,187 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:40,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:40,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:40,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:40,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:40,342 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:40,342 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-09-30 10:57:40,353 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:40,368 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-09-30 10:57:40,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:40,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:40,446 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:40,446 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-09-30 10:57:40,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-30 10:57:40,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-30 10:57:40,447 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:40,447 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-09-30 10:57:40,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:40,645 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-30 10:57:40,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-30 10:57:40,646 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-09-30 10:57:40,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:40,647 INFO L225 Difference]: With dead ends: 23 [2018-09-30 10:57:40,647 INFO L226 Difference]: Without dead ends: 22 [2018-09-30 10:57:40,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-30 10:57:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-30 10:57:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-30 10:57:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-30 10:57:40,652 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-30 10:57:40,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:40,652 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-30 10:57:40,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-30 10:57:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-30 10:57:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-30 10:57:40,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:40,654 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-09-30 10:57:40,654 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:40,654 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-09-30 10:57:40,654 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:40,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:40,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:40,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:40,786 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-09-30 10:57:40,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:40,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:40,879 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:40,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:40,909 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-09-30 10:57:40,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 10:57:40,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 10:57:40,910 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:40,910 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-09-30 10:57:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:41,020 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-30 10:57:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 10:57:41,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-09-30 10:57:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:41,021 INFO L225 Difference]: With dead ends: 24 [2018-09-30 10:57:41,021 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 10:57:41,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 10:57:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-30 10:57:41,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 10:57:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-30 10:57:41,025 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-30 10:57:41,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:41,026 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-30 10:57:41,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 10:57:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-30 10:57:41,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 10:57:41,026 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:41,026 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-09-30 10:57:41,027 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:41,027 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-09-30 10:57:41,027 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:41,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:41,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:41,282 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:41,282 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:41,282 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-09-30 10:57:41,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:41,308 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:41,308 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:41,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:41,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:41,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-09-30 10:57:41,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 10:57:41,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 10:57:41,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:41,667 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-09-30 10:57:41,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:41,839 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-30 10:57:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 10:57:41,840 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-09-30 10:57:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:41,840 INFO L225 Difference]: With dead ends: 25 [2018-09-30 10:57:41,841 INFO L226 Difference]: Without dead ends: 24 [2018-09-30 10:57:41,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-30 10:57:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-30 10:57:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-30 10:57:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-30 10:57:41,844 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-30 10:57:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:41,844 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-30 10:57:41,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 10:57:41,845 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-30 10:57:41,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-30 10:57:41,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:41,845 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-09-30 10:57:41,846 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:41,846 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:41,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-09-30 10:57:41,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:41,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:41,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:41,981 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:41,981 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-09-30 10:57:41,990 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:42,011 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-09-30 10:57:42,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:42,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:42,202 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:42,203 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-09-30 10:57:42,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 10:57:42,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 10:57:42,204 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:42,204 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-09-30 10:57:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:42,588 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-30 10:57:42,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-30 10:57:42,591 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-09-30 10:57:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:42,591 INFO L225 Difference]: With dead ends: 26 [2018-09-30 10:57:42,591 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 10:57:42,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 10:57:42,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-30 10:57:42,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 10:57:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-30 10:57:42,595 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-30 10:57:42,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:42,595 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-30 10:57:42,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 10:57:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-30 10:57:42,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 10:57:42,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:42,596 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-09-30 10:57:42,596 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:42,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:42,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-09-30 10:57:42,596 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:42,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:42,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:42,597 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:42,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:42,891 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:42,891 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-09-30 10:57:42,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:42,946 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:42,947 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:42,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:43,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:43,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-09-30 10:57:43,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-30 10:57:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-30 10:57:43,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:43,069 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-09-30 10:57:43,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:43,585 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-30 10:57:43,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 10:57:43,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-09-30 10:57:43,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:43,586 INFO L225 Difference]: With dead ends: 27 [2018-09-30 10:57:43,586 INFO L226 Difference]: Without dead ends: 26 [2018-09-30 10:57:43,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:43,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-30 10:57:43,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-30 10:57:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-30 10:57:43,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-30 10:57:43,590 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-30 10:57:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:43,591 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-30 10:57:43,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-30 10:57:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-30 10:57:43,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-30 10:57:43,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:43,592 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-09-30 10:57:43,592 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:43,592 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-09-30 10:57:43,592 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:43,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:43,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:43,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:43,830 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:43,830 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-09-30 10:57:43,838 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:43,858 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-09-30 10:57:43,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:43,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:43,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:43,944 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-09-30 10:57:43,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 10:57:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 10:57:43,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:43,944 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-09-30 10:57:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:44,337 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-30 10:57:44,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 10:57:44,337 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-09-30 10:57:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:44,338 INFO L225 Difference]: With dead ends: 28 [2018-09-30 10:57:44,338 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 10:57:44,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 10:57:44,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-30 10:57:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 10:57:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-30 10:57:44,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-30 10:57:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:44,344 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-30 10:57:44,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 10:57:44,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-30 10:57:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 10:57:44,344 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:44,345 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-09-30 10:57:44,345 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:44,345 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-09-30 10:57:44,345 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:44,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:44,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:44,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:45,096 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:45,096 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:45,096 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-09-30 10:57:45,104 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:45,124 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 10:57:45,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:45,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:45,261 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:45,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-09-30 10:57:45,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-30 10:57:45,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-30 10:57:45,263 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:45,263 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-09-30 10:57:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:45,485 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-30 10:57:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-30 10:57:45,486 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-09-30 10:57:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:45,486 INFO L225 Difference]: With dead ends: 29 [2018-09-30 10:57:45,486 INFO L226 Difference]: Without dead ends: 28 [2018-09-30 10:57:45,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:45,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-30 10:57:45,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-30 10:57:45,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-30 10:57:45,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-30 10:57:45,491 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-30 10:57:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:45,491 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-30 10:57:45,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-30 10:57:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-30 10:57:45,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-30 10:57:45,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:45,493 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-09-30 10:57:45,493 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:45,493 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:45,494 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-09-30 10:57:45,494 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:45,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:45,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:45,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:45,650 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:45,651 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:45,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 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-09-30 10:57:45,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:45,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:45,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:45,834 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-09-30 10:57:45,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-30 10:57:45,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-30 10:57:45,835 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:45,835 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-09-30 10:57:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:45,987 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-30 10:57:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-30 10:57:45,988 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-09-30 10:57:45,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:45,989 INFO L225 Difference]: With dead ends: 30 [2018-09-30 10:57:45,989 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 10:57:45,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:45,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 10:57:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-30 10:57:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 10:57:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-30 10:57:45,993 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-30 10:57:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:45,994 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-30 10:57:45,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-30 10:57:45,994 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-30 10:57:45,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 10:57:45,995 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:45,995 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-09-30 10:57:45,995 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:45,995 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:45,995 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-09-30 10:57:45,995 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:45,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:45,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:45,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:46,573 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:46,573 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:46,573 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-09-30 10:57:46,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:46,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:46,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:46,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:46,803 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:46,823 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:46,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-09-30 10:57:46,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-30 10:57:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-30 10:57:46,824 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:46,824 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-09-30 10:57:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:46,996 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-30 10:57:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-30 10:57:46,997 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-09-30 10:57:46,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:46,997 INFO L225 Difference]: With dead ends: 31 [2018-09-30 10:57:46,998 INFO L226 Difference]: Without dead ends: 30 [2018-09-30 10:57:46,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-30 10:57:47,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-30 10:57:47,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-30 10:57:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-30 10:57:47,001 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-30 10:57:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:47,002 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-30 10:57:47,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-30 10:57:47,002 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-30 10:57:47,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-30 10:57:47,002 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:47,002 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-09-30 10:57:47,003 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:47,003 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-09-30 10:57:47,003 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:47,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:47,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:47,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:47,278 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:47,278 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-09-30 10:57:47,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:47,309 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-30 10:57:47,310 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:47,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:47,380 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:47,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:47,403 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-09-30 10:57:47,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 10:57:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 10:57:47,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:47,403 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-09-30 10:57:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:47,663 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-30 10:57:47,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 10:57:47,663 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-09-30 10:57:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:47,664 INFO L225 Difference]: With dead ends: 32 [2018-09-30 10:57:47,664 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 10:57:47,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:47,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 10:57:47,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-30 10:57:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 10:57:47,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-30 10:57:47,668 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-30 10:57:47,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:47,668 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-30 10:57:47,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 10:57:47,668 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-30 10:57:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 10:57:47,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:47,669 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-09-30 10:57:47,669 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:47,669 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:47,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-09-30 10:57:47,669 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:47,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:47,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:47,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:47,841 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:47,841 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:47,842 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-09-30 10:57:47,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:47,867 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:47,868 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:47,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:47,943 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:47,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:47,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-09-30 10:57:47,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-30 10:57:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-30 10:57:47,965 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:47,965 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-09-30 10:57:48,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:48,138 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-30 10:57:48,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-30 10:57:48,138 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-09-30 10:57:48,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:48,139 INFO L225 Difference]: With dead ends: 33 [2018-09-30 10:57:48,139 INFO L226 Difference]: Without dead ends: 32 [2018-09-30 10:57:48,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:48,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-30 10:57:48,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-30 10:57:48,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-30 10:57:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-30 10:57:48,144 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-30 10:57:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:48,144 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-30 10:57:48,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-30 10:57:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-30 10:57:48,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-30 10:57:48,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:48,145 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-09-30 10:57:48,145 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:48,145 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:48,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-09-30 10:57:48,145 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:48,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:48,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:48,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:48,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:48,412 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:48,412 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-09-30 10:57:48,424 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:48,461 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-09-30 10:57:48,462 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:48,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:48,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:48,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-09-30 10:57:48,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 10:57:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 10:57:48,610 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:48,610 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-09-30 10:57:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:48,767 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-30 10:57:48,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 10:57:48,768 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-09-30 10:57:48,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:48,769 INFO L225 Difference]: With dead ends: 34 [2018-09-30 10:57:48,769 INFO L226 Difference]: Without dead ends: 33 [2018-09-30 10:57:48,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-30 10:57:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-30 10:57:48,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-30 10:57:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-30 10:57:48,777 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-30 10:57:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:48,778 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-30 10:57:48,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 10:57:48,778 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-30 10:57:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-30 10:57:48,778 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:48,778 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-09-30 10:57:48,779 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:48,779 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:48,779 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-09-30 10:57:48,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:48,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:48,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:48,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:48,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:49,117 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:49,117 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-09-30 10:57:49,126 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:49,205 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-09-30 10:57:49,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:49,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:49,307 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:49,329 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:49,330 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-09-30 10:57:49,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-30 10:57:49,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-30 10:57:49,330 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:49,330 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-09-30 10:57:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:49,510 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-30 10:57:49,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 10:57:49,511 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-09-30 10:57:49,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:49,512 INFO L225 Difference]: With dead ends: 35 [2018-09-30 10:57:49,512 INFO L226 Difference]: Without dead ends: 34 [2018-09-30 10:57:49,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-30 10:57:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-30 10:57:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-30 10:57:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-30 10:57:49,516 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-30 10:57:49,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:49,516 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-30 10:57:49,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-30 10:57:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-30 10:57:49,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-30 10:57:49,517 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:49,517 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-09-30 10:57:49,517 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:49,517 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:49,518 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-09-30 10:57:49,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:49,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:49,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:49,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:49,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:49,683 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:49,683 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-09-30 10:57:49,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:49,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:49,829 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:49,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:49,851 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-09-30 10:57:49,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 10:57:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 10:57:49,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:49,851 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-09-30 10:57:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:50,142 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-30 10:57:50,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-30 10:57:50,143 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-09-30 10:57:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:50,143 INFO L225 Difference]: With dead ends: 36 [2018-09-30 10:57:50,144 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 10:57:50,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 10:57:50,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 10:57:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 10:57:50,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-30 10:57:50,148 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-30 10:57:50,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:50,148 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-30 10:57:50,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 10:57:50,148 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-30 10:57:50,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 10:57:50,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:50,150 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-09-30 10:57:50,150 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:50,150 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:50,150 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-09-30 10:57:50,150 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:50,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:50,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:50,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:50,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:50,519 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:50,519 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:50,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:50,549 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:50,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:50,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:50,703 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:50,703 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-09-30 10:57:50,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 10:57:50,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 10:57:50,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:50,704 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-09-30 10:57:50,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:50,861 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-30 10:57:50,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-30 10:57:50,875 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-09-30 10:57:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:50,875 INFO L225 Difference]: With dead ends: 37 [2018-09-30 10:57:50,875 INFO L226 Difference]: Without dead ends: 36 [2018-09-30 10:57:50,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:50,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-30 10:57:50,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-30 10:57:50,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-30 10:57:50,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-30 10:57:50,879 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-30 10:57:50,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:50,879 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-30 10:57:50,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 10:57:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-30 10:57:50,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-30 10:57:50,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:50,880 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-09-30 10:57:50,880 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:50,881 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-09-30 10:57:50,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:50,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:50,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:50,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:51,094 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:51,094 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-09-30 10:57:51,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:51,128 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-09-30 10:57:51,128 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:51,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:51,227 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:51,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:51,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-09-30 10:57:51,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-30 10:57:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-30 10:57:51,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:51,249 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-09-30 10:57:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:51,445 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-30 10:57:51,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-30 10:57:51,445 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-09-30 10:57:51,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:51,446 INFO L225 Difference]: With dead ends: 38 [2018-09-30 10:57:51,446 INFO L226 Difference]: Without dead ends: 37 [2018-09-30 10:57:51,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-30 10:57:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-30 10:57:51,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-30 10:57:51,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-30 10:57:51,450 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-30 10:57:51,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:51,451 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-30 10:57:51,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-30 10:57:51,451 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-30 10:57:51,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-30 10:57:51,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:51,451 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-09-30 10:57:51,452 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:51,452 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:51,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-09-30 10:57:51,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:51,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:51,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:51,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:52,087 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:52,088 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:52,088 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-09-30 10:57:52,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:52,120 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:52,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:52,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:52,310 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:52,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:52,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-09-30 10:57:52,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-30 10:57:52,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-30 10:57:52,331 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:52,331 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-09-30 10:57:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:52,534 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-30 10:57:52,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-30 10:57:52,534 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-09-30 10:57:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:52,535 INFO L225 Difference]: With dead ends: 39 [2018-09-30 10:57:52,535 INFO L226 Difference]: Without dead ends: 38 [2018-09-30 10:57:52,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-30 10:57:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-30 10:57:52,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-30 10:57:52,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-30 10:57:52,538 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-30 10:57:52,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:52,538 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-30 10:57:52,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-30 10:57:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-30 10:57:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-30 10:57:52,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:52,539 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-09-30 10:57:52,539 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:52,539 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:52,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-09-30 10:57:52,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:52,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:52,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:52,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:52,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:52,729 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:52,729 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:52,730 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-09-30 10:57:52,738 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:52,773 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-09-30 10:57:52,773 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:52,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:52,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:52,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-09-30 10:57:52,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 10:57:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 10:57:52,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:52,874 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-09-30 10:57:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:53,125 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-30 10:57:53,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 10:57:53,126 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-09-30 10:57:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:53,126 INFO L225 Difference]: With dead ends: 40 [2018-09-30 10:57:53,126 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 10:57:53,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:53,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 10:57:53,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-30 10:57:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-30 10:57:53,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-30 10:57:53,131 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-30 10:57:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:53,131 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-30 10:57:53,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 10:57:53,131 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-30 10:57:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-30 10:57:53,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:53,131 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-09-30 10:57:53,132 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:53,132 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-09-30 10:57:53,132 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:53,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:53,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:53,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:53,341 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:53,341 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:53,341 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:53,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:53,377 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-30 10:57:53,378 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:53,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:53,964 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:53,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-09-30 10:57:53,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-30 10:57:53,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-30 10:57:53,964 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:53,964 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-09-30 10:57:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:54,170 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-30 10:57:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-30 10:57:54,170 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-09-30 10:57:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:54,171 INFO L225 Difference]: With dead ends: 41 [2018-09-30 10:57:54,171 INFO L226 Difference]: Without dead ends: 40 [2018-09-30 10:57:54,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:54,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-30 10:57:54,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-30 10:57:54,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-30 10:57:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-30 10:57:54,175 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-30 10:57:54,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:54,175 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-30 10:57:54,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-30 10:57:54,176 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-30 10:57:54,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-30 10:57:54,176 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:54,176 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-09-30 10:57:54,176 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:54,176 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:54,177 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-09-30 10:57:54,177 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:54,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:54,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:54,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:54,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:54,400 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:54,400 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:54,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:54,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:54,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-09-30 10:57:54,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-30 10:57:54,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-30 10:57:54,515 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:54,515 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-09-30 10:57:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:54,708 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-30 10:57:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 10:57:54,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-09-30 10:57:54,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:54,709 INFO L225 Difference]: With dead ends: 42 [2018-09-30 10:57:54,709 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 10:57:54,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 10:57:54,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-30 10:57:54,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 10:57:54,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-30 10:57:54,711 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-30 10:57:54,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:54,712 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-30 10:57:54,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-30 10:57:54,712 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-30 10:57:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 10:57:54,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:54,713 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-09-30 10:57:54,713 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:54,713 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:54,713 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-09-30 10:57:54,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:54,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:54,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:54,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:54,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:54,977 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:54,977 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:54,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:55,008 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:55,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:55,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:55,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:55,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-09-30 10:57:55,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 10:57:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 10:57:55,103 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:55,103 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-09-30 10:57:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:55,319 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-30 10:57:55,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 10:57:55,320 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-09-30 10:57:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:55,321 INFO L225 Difference]: With dead ends: 43 [2018-09-30 10:57:55,321 INFO L226 Difference]: Without dead ends: 42 [2018-09-30 10:57:55,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:55,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-30 10:57:55,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-30 10:57:55,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-30 10:57:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-30 10:57:55,324 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-30 10:57:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:55,325 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-30 10:57:55,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 10:57:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-30 10:57:55,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-30 10:57:55,326 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:55,326 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-09-30 10:57:55,326 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:55,326 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-09-30 10:57:55,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:55,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:55,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:55,568 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:55,569 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:55,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:57:55,611 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-09-30 10:57:55,611 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:55,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:55,726 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:55,746 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:55,746 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-09-30 10:57:55,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 10:57:55,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 10:57:55,747 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:55,747 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-09-30 10:57:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:56,020 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-30 10:57:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 10:57:56,020 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-09-30 10:57:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:56,021 INFO L225 Difference]: With dead ends: 44 [2018-09-30 10:57:56,021 INFO L226 Difference]: Without dead ends: 43 [2018-09-30 10:57:56,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-30 10:57:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-30 10:57:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 10:57:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-30 10:57:56,024 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-30 10:57:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:56,025 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-30 10:57:56,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 10:57:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-30 10:57:56,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 10:57:56,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:56,025 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-09-30 10:57:56,025 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:56,025 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:56,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-09-30 10:57:56,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:56,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:56,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:56,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:56,711 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:56,711 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:56,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:57:56,742 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:57:56,742 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:56,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:56,826 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:56,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:56,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-09-30 10:57:56,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-30 10:57:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-30 10:57:56,847 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:56,847 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-09-30 10:57:57,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:57,131 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-30 10:57:57,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 10:57:57,132 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-09-30 10:57:57,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:57,132 INFO L225 Difference]: With dead ends: 45 [2018-09-30 10:57:57,133 INFO L226 Difference]: Without dead ends: 44 [2018-09-30 10:57:57,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:57,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-30 10:57:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-30 10:57:57,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-30 10:57:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-30 10:57:57,135 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-30 10:57:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:57,136 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-30 10:57:57,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-30 10:57:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-30 10:57:57,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-30 10:57:57,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:57,136 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-09-30 10:57:57,137 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:57,137 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:57,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-09-30 10:57:57,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:57,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:57,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:57,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:57,373 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:57,373 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:57,381 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:57:57,417 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-09-30 10:57:57,417 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:57,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:57,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:57,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-09-30 10:57:57,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-30 10:57:57,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-30 10:57:57,521 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:57,522 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-09-30 10:57:57,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:57,847 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-30 10:57:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 10:57:57,848 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-09-30 10:57:57,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:57,848 INFO L225 Difference]: With dead ends: 46 [2018-09-30 10:57:57,849 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 10:57:57,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:57,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 10:57:57,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-30 10:57:57,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 10:57:57,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-30 10:57:57,851 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-30 10:57:57,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:57,851 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-30 10:57:57,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-30 10:57:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-30 10:57:57,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 10:57:57,852 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:57,852 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-09-30 10:57:57,852 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:57,852 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-09-30 10:57:57,852 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:57,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:57,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:57,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:57,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:58,242 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:58,242 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:58,250 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:57:58,281 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-30 10:57:58,282 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:58,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:58,395 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:58,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-09-30 10:57:58,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-30 10:57:58,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-30 10:57:58,396 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:58,396 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-09-30 10:57:58,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:58,758 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-30 10:57:58,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-30 10:57:58,759 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-09-30 10:57:58,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:58,759 INFO L225 Difference]: With dead ends: 47 [2018-09-30 10:57:58,759 INFO L226 Difference]: Without dead ends: 46 [2018-09-30 10:57:58,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-30 10:57:58,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-30 10:57:58,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-30 10:57:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-30 10:57:58,762 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-30 10:57:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:58,762 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-30 10:57:58,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-30 10:57:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-30 10:57:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-30 10:57:58,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:58,763 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-09-30 10:57:58,764 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:58,764 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:58,764 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-09-30 10:57:58,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:58,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:58,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:58,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:57:58,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:59,122 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:59,122 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:59,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:59,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:59,251 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:59,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:59,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-09-30 10:57:59,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 10:57:59,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 10:57:59,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:59,273 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-09-30 10:57:59,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:57:59,493 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-30 10:57:59,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-30 10:57:59,493 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-09-30 10:57:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:57:59,494 INFO L225 Difference]: With dead ends: 48 [2018-09-30 10:57:59,494 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 10:57:59,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:57:59,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 10:57:59,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 10:57:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 10:57:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-30 10:57:59,497 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-30 10:57:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:57:59,497 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-30 10:57:59,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 10:57:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-30 10:57:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 10:57:59,498 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:57:59,498 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-09-30 10:57:59,498 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:57:59,498 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:57:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-09-30 10:57:59,499 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:57:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:57:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:59,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:57:59,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:57:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:57:59,740 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:59,741 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:57:59,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:57:59,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:57:59,775 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:57:59,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:57:59,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:57:59,863 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:57:59,884 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:57:59,884 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-09-30 10:57:59,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 10:57:59,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 10:57:59,885 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:57:59,885 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-09-30 10:58:00,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:00,110 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-30 10:58:00,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-30 10:58:00,111 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-09-30 10:58:00,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:00,111 INFO L225 Difference]: With dead ends: 49 [2018-09-30 10:58:00,112 INFO L226 Difference]: Without dead ends: 48 [2018-09-30 10:58:00,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-30 10:58:00,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-30 10:58:00,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-30 10:58:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-30 10:58:00,115 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-30 10:58:00,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:00,115 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-30 10:58:00,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 10:58:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-30 10:58:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-30 10:58:00,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:00,116 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-09-30 10:58:00,116 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:00,116 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:00,116 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-09-30 10:58:00,116 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:00,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:00,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:00,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:00,370 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:00,370 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:00,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:00,414 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-09-30 10:58:00,415 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:00,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:00,544 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:00,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-09-30 10:58:00,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 10:58:00,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 10:58:00,545 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:00,546 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-09-30 10:58:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:01,084 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-30 10:58:01,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 10:58:01,085 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-09-30 10:58:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:01,086 INFO L225 Difference]: With dead ends: 50 [2018-09-30 10:58:01,086 INFO L226 Difference]: Without dead ends: 49 [2018-09-30 10:58:01,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:01,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-30 10:58:01,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-30 10:58:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-30 10:58:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-30 10:58:01,089 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-30 10:58:01,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:01,090 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-30 10:58:01,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 10:58:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-30 10:58:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-30 10:58:01,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:01,091 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-09-30 10:58:01,091 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:01,091 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:01,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-09-30 10:58:01,091 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:01,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:01,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:01,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:01,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:01,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:01,364 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:01,364 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:01,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:01,400 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:01,400 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:01,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:01,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:01,568 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:01,568 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-09-30 10:58:01,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-30 10:58:01,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-30 10:58:01,569 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:01,569 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-09-30 10:58:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:01,851 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-30 10:58:01,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 10:58:01,851 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-09-30 10:58:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:01,852 INFO L225 Difference]: With dead ends: 51 [2018-09-30 10:58:01,852 INFO L226 Difference]: Without dead ends: 50 [2018-09-30 10:58:01,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-30 10:58:01,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-30 10:58:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-30 10:58:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-30 10:58:01,855 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-30 10:58:01,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:01,855 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-30 10:58:01,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-30 10:58:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-30 10:58:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-30 10:58:01,856 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:01,856 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-09-30 10:58:01,857 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:01,857 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-09-30 10:58:01,857 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:01,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:01,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:01,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:02,212 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:02,213 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:02,220 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:02,258 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-30 10:58:02,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:02,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:02,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:02,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-09-30 10:58:02,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 10:58:02,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 10:58:02,395 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:02,395 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-09-30 10:58:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:02,647 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-30 10:58:02,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 10:58:02,647 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-09-30 10:58:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:02,648 INFO L225 Difference]: With dead ends: 52 [2018-09-30 10:58:02,648 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 10:58:02,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:02,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 10:58:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-30 10:58:02,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 10:58:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-30 10:58:02,651 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-30 10:58:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:02,651 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-30 10:58:02,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 10:58:02,651 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-30 10:58:02,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 10:58:02,652 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:02,652 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-09-30 10:58:02,652 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:02,652 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:02,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-09-30 10:58:02,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:02,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:02,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:02,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:02,916 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:02,916 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:02,924 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:02,960 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-30 10:58:02,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:02,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:03,073 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:03,073 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-09-30 10:58:03,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-30 10:58:03,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-30 10:58:03,074 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:03,074 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-09-30 10:58:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:03,277 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-30 10:58:03,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 10:58:03,278 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-09-30 10:58:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:03,279 INFO L225 Difference]: With dead ends: 53 [2018-09-30 10:58:03,279 INFO L226 Difference]: Without dead ends: 52 [2018-09-30 10:58:03,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-30 10:58:03,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-30 10:58:03,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-30 10:58:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-30 10:58:03,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-30 10:58:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:03,283 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-30 10:58:03,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-30 10:58:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-30 10:58:03,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-30 10:58:03,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:03,283 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-09-30 10:58:03,283 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:03,284 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:03,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-09-30 10:58:03,284 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:03,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:03,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:04,305 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:04,305 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:04,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:04,449 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:04,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-09-30 10:58:04,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-30 10:58:04,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-30 10:58:04,450 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:04,450 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-09-30 10:58:04,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:04,758 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-30 10:58:04,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-30 10:58:04,759 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-09-30 10:58:04,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:04,760 INFO L225 Difference]: With dead ends: 54 [2018-09-30 10:58:04,760 INFO L226 Difference]: Without dead ends: 53 [2018-09-30 10:58:04,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:04,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-30 10:58:04,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-30 10:58:04,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-30 10:58:04,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-30 10:58:04,762 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-30 10:58:04,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:04,762 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-30 10:58:04,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-30 10:58:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-30 10:58:04,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-30 10:58:04,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:04,763 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-09-30 10:58:04,763 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:04,763 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:04,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-09-30 10:58:04,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:04,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:04,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:04,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:05,019 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:05,019 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:05,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:05,065 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:05,065 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:05,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:05,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:05,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:05,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-09-30 10:58:05,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-30 10:58:05,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-30 10:58:05,215 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:05,215 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-09-30 10:58:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:05,543 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-30 10:58:05,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 10:58:05,544 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-09-30 10:58:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:05,545 INFO L225 Difference]: With dead ends: 55 [2018-09-30 10:58:05,545 INFO L226 Difference]: Without dead ends: 54 [2018-09-30 10:58:05,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-30 10:58:05,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-30 10:58:05,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-30 10:58:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-30 10:58:05,547 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-30 10:58:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:05,548 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-30 10:58:05,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-30 10:58:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-30 10:58:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-30 10:58:05,549 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:05,549 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-09-30 10:58:05,549 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:05,549 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:05,549 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-09-30 10:58:05,550 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:05,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:05,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:05,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:05,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:05,842 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:05,842 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:05,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:05,913 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-30 10:58:05,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:05,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:06,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:06,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-09-30 10:58:06,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-30 10:58:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-30 10:58:06,053 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:06,054 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-09-30 10:58:06,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:06,291 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-30 10:58:06,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-30 10:58:06,291 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-09-30 10:58:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:06,292 INFO L225 Difference]: With dead ends: 56 [2018-09-30 10:58:06,292 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 10:58:06,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:06,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 10:58:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-30 10:58:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 10:58:06,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-30 10:58:06,295 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-30 10:58:06,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:06,296 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-30 10:58:06,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-30 10:58:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-30 10:58:06,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-30 10:58:06,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:06,296 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-09-30 10:58:06,297 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:06,297 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:06,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-09-30 10:58:06,297 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:06,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:06,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:06,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:06,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:06,580 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:06,580 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:06,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:06,621 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:06,621 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:06,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:06,883 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:06,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-09-30 10:58:06,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-30 10:58:06,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-30 10:58:06,884 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:06,884 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-09-30 10:58:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:07,212 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-30 10:58:07,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-30 10:58:07,212 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-09-30 10:58:07,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:07,213 INFO L225 Difference]: With dead ends: 57 [2018-09-30 10:58:07,213 INFO L226 Difference]: Without dead ends: 56 [2018-09-30 10:58:07,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:07,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-30 10:58:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-30 10:58:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-30 10:58:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-30 10:58:07,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-30 10:58:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:07,216 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-30 10:58:07,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-30 10:58:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-30 10:58:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-30 10:58:07,217 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:07,217 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-09-30 10:58:07,217 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:07,217 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:07,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-09-30 10:58:07,217 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:07,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:07,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:07,771 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:07,771 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:07,778 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:07,825 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-09-30 10:58:07,826 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:07,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:07,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:07,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-09-30 10:58:07,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-30 10:58:07,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-30 10:58:07,944 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:07,944 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-09-30 10:58:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:08,296 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-30 10:58:08,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 10:58:08,296 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-09-30 10:58:08,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:08,297 INFO L225 Difference]: With dead ends: 58 [2018-09-30 10:58:08,297 INFO L226 Difference]: Without dead ends: 57 [2018-09-30 10:58:08,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:08,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-30 10:58:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-30 10:58:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-30 10:58:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-30 10:58:08,300 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-30 10:58:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:08,300 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-30 10:58:08,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-30 10:58:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-30 10:58:08,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-30 10:58:08,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:08,301 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-09-30 10:58:08,301 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:08,301 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-09-30 10:58:08,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:08,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:08,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:08,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:08,606 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:08,606 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:08,614 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:08,659 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-09-30 10:58:08,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:08,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:08,857 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:08,857 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-09-30 10:58:08,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-30 10:58:08,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-30 10:58:08,858 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:08,858 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-09-30 10:58:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:09,329 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-30 10:58:09,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 10:58:09,329 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-09-30 10:58:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:09,330 INFO L225 Difference]: With dead ends: 59 [2018-09-30 10:58:09,330 INFO L226 Difference]: Without dead ends: 58 [2018-09-30 10:58:09,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-30 10:58:09,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-30 10:58:09,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-30 10:58:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-30 10:58:09,333 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-30 10:58:09,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:09,333 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-30 10:58:09,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-30 10:58:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-30 10:58:09,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-30 10:58:09,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:09,333 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-09-30 10:58:09,334 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:09,334 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:09,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-09-30 10:58:09,334 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:09,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:09,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:09,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:09,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:09,822 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:09,822 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:09,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:09,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:09,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:09,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:09,984 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:09,985 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-09-30 10:58:09,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 10:58:09,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 10:58:09,985 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:09,985 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-09-30 10:58:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:10,243 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-30 10:58:10,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-30 10:58:10,243 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-09-30 10:58:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:10,244 INFO L225 Difference]: With dead ends: 60 [2018-09-30 10:58:10,244 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 10:58:10,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 10:58:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-30 10:58:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 10:58:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-30 10:58:10,247 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-30 10:58:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:10,247 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-30 10:58:10,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 10:58:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-30 10:58:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 10:58:10,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:10,248 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-09-30 10:58:10,248 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:10,248 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-09-30 10:58:10,248 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:10,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:10,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:10,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:10,938 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:10,938 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:10,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:10,982 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:10,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:10,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:11,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:11,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-09-30 10:58:11,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-30 10:58:11,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-30 10:58:11,125 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:11,125 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-09-30 10:58:11,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:11,489 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-30 10:58:11,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 10:58:11,489 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-09-30 10:58:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:11,490 INFO L225 Difference]: With dead ends: 61 [2018-09-30 10:58:11,490 INFO L226 Difference]: Without dead ends: 60 [2018-09-30 10:58:11,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-30 10:58:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-30 10:58:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-30 10:58:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-30 10:58:11,493 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-30 10:58:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:11,494 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-30 10:58:11,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-30 10:58:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-30 10:58:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-30 10:58:11,494 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:11,494 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-09-30 10:58:11,495 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:11,495 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:11,495 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-09-30 10:58:11,495 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:11,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:11,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:11,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:11,940 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:11,940 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:11,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:11,992 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-09-30 10:58:11,993 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:11,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:12,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:12,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:12,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-09-30 10:58:12,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-30 10:58:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-30 10:58:12,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:12,134 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-09-30 10:58:12,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:12,401 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-30 10:58:12,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-30 10:58:12,401 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-09-30 10:58:12,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:12,402 INFO L225 Difference]: With dead ends: 62 [2018-09-30 10:58:12,402 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 10:58:12,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 10:58:12,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-30 10:58:12,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 10:58:12,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-30 10:58:12,404 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-30 10:58:12,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:12,405 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-30 10:58:12,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-30 10:58:12,405 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-30 10:58:12,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 10:58:12,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:12,406 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-09-30 10:58:12,406 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:12,407 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:12,407 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-09-30 10:58:12,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:12,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:12,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:12,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:12,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:12,720 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:12,720 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:12,729 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:12,763 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:12,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:12,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:12,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:12,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:12,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-09-30 10:58:12,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-30 10:58:12,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-30 10:58:12,896 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:12,896 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-09-30 10:58:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:13,285 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-30 10:58:13,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-30 10:58:13,285 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-09-30 10:58:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:13,286 INFO L225 Difference]: With dead ends: 63 [2018-09-30 10:58:13,286 INFO L226 Difference]: Without dead ends: 62 [2018-09-30 10:58:13,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-30 10:58:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-30 10:58:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-30 10:58:13,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-30 10:58:13,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-30 10:58:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:13,290 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-30 10:58:13,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-30 10:58:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-30 10:58:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-30 10:58:13,291 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:13,291 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-09-30 10:58:13,291 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:13,291 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-09-30 10:58:13,292 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:13,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:13,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:13,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:13,851 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:13,851 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:13,858 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:13,921 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-09-30 10:58:13,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:13,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:14,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:14,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-09-30 10:58:14,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 10:58:14,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 10:58:14,151 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:14,151 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-09-30 10:58:14,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:14,609 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-30 10:58:14,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-30 10:58:14,609 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-09-30 10:58:14,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:14,610 INFO L225 Difference]: With dead ends: 64 [2018-09-30 10:58:14,610 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 10:58:14,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 10:58:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-30 10:58:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-30 10:58:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-30 10:58:14,613 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-30 10:58:14,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:14,613 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-30 10:58:14,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 10:58:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-30 10:58:14,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 10:58:14,614 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:14,614 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-09-30 10:58:14,614 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:14,614 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:14,614 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-09-30 10:58:14,614 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:14,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:14,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:14,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:16,209 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:16,209 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:16,218 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:16,265 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-30 10:58:16,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:16,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:16,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:16,495 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:16,495 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-09-30 10:58:16,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-30 10:58:16,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-30 10:58:16,496 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:16,496 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-09-30 10:58:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:16,829 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-30 10:58:16,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-30 10:58:16,830 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-09-30 10:58:16,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:16,831 INFO L225 Difference]: With dead ends: 65 [2018-09-30 10:58:16,831 INFO L226 Difference]: Without dead ends: 64 [2018-09-30 10:58:16,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-30 10:58:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-30 10:58:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-30 10:58:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-30 10:58:16,834 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-30 10:58:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:16,834 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-30 10:58:16,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-30 10:58:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-30 10:58:16,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-30 10:58:16,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:16,835 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-09-30 10:58:16,835 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:16,835 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:16,836 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-09-30 10:58:16,836 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:16,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:16,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:16,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:16,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:16,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:17,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:17,679 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:17,679 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:17,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:17,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:17,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:17,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:17,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-09-30 10:58:17,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-30 10:58:17,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-30 10:58:17,952 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:17,952 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-09-30 10:58:18,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:18,246 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-30 10:58:18,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-30 10:58:18,250 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-09-30 10:58:18,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:18,250 INFO L225 Difference]: With dead ends: 66 [2018-09-30 10:58:18,250 INFO L226 Difference]: Without dead ends: 65 [2018-09-30 10:58:18,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-30 10:58:18,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-30 10:58:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-30 10:58:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-30 10:58:18,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-30 10:58:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:18,253 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-30 10:58:18,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-30 10:58:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-30 10:58:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-30 10:58:18,254 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:18,254 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-09-30 10:58:18,254 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:18,254 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-09-30 10:58:18,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:18,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:18,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:18,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:18,577 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:18,577 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:18,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:18,622 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:18,622 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:18,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:18,766 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:18,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-09-30 10:58:18,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-30 10:58:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-30 10:58:18,767 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:18,768 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-09-30 10:58:19,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:19,400 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-30 10:58:19,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 10:58:19,401 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-09-30 10:58:19,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:19,402 INFO L225 Difference]: With dead ends: 67 [2018-09-30 10:58:19,402 INFO L226 Difference]: Without dead ends: 66 [2018-09-30 10:58:19,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-30 10:58:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-30 10:58:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-30 10:58:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-30 10:58:19,405 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-30 10:58:19,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:19,405 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-30 10:58:19,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-30 10:58:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-30 10:58:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-30 10:58:19,406 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:19,406 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-09-30 10:58:19,407 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:19,407 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-09-30 10:58:19,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:19,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:19,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:19,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:20,537 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:20,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:20,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:20,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-09-30 10:58:20,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:20,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:21,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:21,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-09-30 10:58:21,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-30 10:58:21,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-30 10:58:21,050 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:21,050 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-09-30 10:58:21,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:21,477 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-30 10:58:21,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 10:58:21,477 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-09-30 10:58:21,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:21,478 INFO L225 Difference]: With dead ends: 68 [2018-09-30 10:58:21,478 INFO L226 Difference]: Without dead ends: 67 [2018-09-30 10:58:21,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-30 10:58:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-30 10:58:21,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 10:58:21,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-30 10:58:21,482 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-30 10:58:21,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:21,482 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-30 10:58:21,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-30 10:58:21,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-30 10:58:21,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 10:58:21,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:21,483 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-09-30 10:58:21,483 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:21,483 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:21,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-09-30 10:58:21,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:21,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:21,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:21,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:21,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:21,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:21,876 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:21,876 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:21,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:21,921 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:21,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:21,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:22,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:22,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-09-30 10:58:22,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-30 10:58:22,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-30 10:58:22,070 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:22,070 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-09-30 10:58:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:22,424 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-30 10:58:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 10:58:22,424 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-09-30 10:58:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:22,425 INFO L225 Difference]: With dead ends: 69 [2018-09-30 10:58:22,425 INFO L226 Difference]: Without dead ends: 68 [2018-09-30 10:58:22,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:22,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-30 10:58:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-30 10:58:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-30 10:58:22,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-30 10:58:22,427 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-30 10:58:22,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:22,427 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-30 10:58:22,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-30 10:58:22,427 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-30 10:58:22,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-30 10:58:22,428 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:22,428 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-09-30 10:58:22,428 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:22,428 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:22,428 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-09-30 10:58:22,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:22,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:22,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:22,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:22,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:22,794 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:22,794 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:22,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:22,896 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-09-30 10:58:22,897 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:22,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:23,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:23,040 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-09-30 10:58:23,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 10:58:23,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 10:58:23,041 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:23,041 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-09-30 10:58:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:23,393 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-30 10:58:23,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-30 10:58:23,393 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-09-30 10:58:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:23,394 INFO L225 Difference]: With dead ends: 70 [2018-09-30 10:58:23,394 INFO L226 Difference]: Without dead ends: 69 [2018-09-30 10:58:23,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:23,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-30 10:58:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-30 10:58:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-30 10:58:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-30 10:58:23,398 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-30 10:58:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:23,398 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-30 10:58:23,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 10:58:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-30 10:58:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-30 10:58:23,398 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:23,398 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-09-30 10:58:23,399 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:23,399 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:23,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-09-30 10:58:23,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:23,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:23,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:23,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:23,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:23,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:23,726 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:23,726 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:23,733 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:23,790 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-30 10:58:23,790 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:23,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:23,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:23,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-09-30 10:58:23,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-30 10:58:23,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-30 10:58:23,947 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:23,947 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-09-30 10:58:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:24,591 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-30 10:58:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 10:58:24,591 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-09-30 10:58:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:24,592 INFO L225 Difference]: With dead ends: 71 [2018-09-30 10:58:24,592 INFO L226 Difference]: Without dead ends: 70 [2018-09-30 10:58:24,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-30 10:58:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-30 10:58:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-30 10:58:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-30 10:58:24,596 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-30 10:58:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:24,596 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-30 10:58:24,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-30 10:58:24,596 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-30 10:58:24,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-30 10:58:24,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:24,597 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-09-30 10:58:24,597 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:24,597 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:24,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-09-30 10:58:24,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:24,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:24,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:24,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:24,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:24,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:24,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:24,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:24,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:25,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:25,224 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-09-30 10:58:25,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 10:58:25,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 10:58:25,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:25,225 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-09-30 10:58:25,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:25,701 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-30 10:58:25,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-30 10:58:25,701 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-09-30 10:58:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:25,702 INFO L225 Difference]: With dead ends: 72 [2018-09-30 10:58:25,702 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 10:58:25,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:25,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 10:58:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-30 10:58:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 10:58:25,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-30 10:58:25,705 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-30 10:58:25,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:25,706 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-30 10:58:25,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 10:58:25,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-30 10:58:25,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 10:58:25,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:25,706 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-09-30 10:58:25,706 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:25,706 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:25,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-09-30 10:58:25,707 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:25,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:25,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:25,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:25,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:26,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:26,071 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:26,071 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:26,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:26,118 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:26,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:26,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:26,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:26,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:26,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-09-30 10:58:26,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-30 10:58:26,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-30 10:58:26,271 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:26,271 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-09-30 10:58:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:26,641 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-30 10:58:26,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-30 10:58:26,641 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-09-30 10:58:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:26,642 INFO L225 Difference]: With dead ends: 73 [2018-09-30 10:58:26,642 INFO L226 Difference]: Without dead ends: 72 [2018-09-30 10:58:26,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:26,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-30 10:58:26,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-30 10:58:26,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-30 10:58:26,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-30 10:58:26,644 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-30 10:58:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:26,644 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-30 10:58:26,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-30 10:58:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-30 10:58:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-30 10:58:26,645 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:26,645 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-09-30 10:58:26,645 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:26,645 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-09-30 10:58:26,645 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:26,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:26,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:27,070 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:27,070 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:27,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:27,139 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-09-30 10:58:27,140 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:27,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:27,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:27,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-09-30 10:58:27,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-30 10:58:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-30 10:58:27,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:27,286 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-09-30 10:58:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:27,821 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-30 10:58:27,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 10:58:27,821 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-09-30 10:58:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:27,822 INFO L225 Difference]: With dead ends: 74 [2018-09-30 10:58:27,822 INFO L226 Difference]: Without dead ends: 73 [2018-09-30 10:58:27,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:27,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-30 10:58:27,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-30 10:58:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-30 10:58:27,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-30 10:58:27,826 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-30 10:58:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:27,826 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-30 10:58:27,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-30 10:58:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-30 10:58:27,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-30 10:58:27,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:27,827 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-09-30 10:58:27,827 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:27,827 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:27,827 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-09-30 10:58:27,828 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:27,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:27,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:27,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:28,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:28,199 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:28,199 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:28,206 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:28,252 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:28,253 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:28,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:29,608 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:29,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:29,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-09-30 10:58:29,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-30 10:58:29,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-30 10:58:29,630 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:29,630 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-09-30 10:58:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:31,079 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-30 10:58:31,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-30 10:58:31,080 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-09-30 10:58:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:31,081 INFO L225 Difference]: With dead ends: 75 [2018-09-30 10:58:31,081 INFO L226 Difference]: Without dead ends: 74 [2018-09-30 10:58:31,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-30 10:58:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-30 10:58:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-30 10:58:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-30 10:58:31,084 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-30 10:58:31,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:31,085 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-30 10:58:31,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-30 10:58:31,085 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-30 10:58:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-30 10:58:31,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:31,086 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-09-30 10:58:31,086 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:31,086 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-09-30 10:58:31,086 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:31,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:31,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:31,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:31,456 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:31,456 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:31,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:31,539 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-09-30 10:58:31,540 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:31,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:31,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:31,713 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:31,713 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-09-30 10:58:31,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 10:58:31,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 10:58:31,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:31,714 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-09-30 10:58:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:32,355 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-30 10:58:32,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-30 10:58:32,356 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-09-30 10:58:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:32,357 INFO L225 Difference]: With dead ends: 76 [2018-09-30 10:58:32,357 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 10:58:32,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:32,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 10:58:32,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-30 10:58:32,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 10:58:32,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-30 10:58:32,361 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-30 10:58:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:32,361 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-30 10:58:32,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 10:58:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-30 10:58:32,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-30 10:58:32,362 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:32,362 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-09-30 10:58:32,362 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:32,362 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:32,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-09-30 10:58:32,363 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:32,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:32,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:32,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:32,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:32,756 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:32,756 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:32,763 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:32,860 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-30 10:58:32,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:32,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:33,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:33,500 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-09-30 10:58:33,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-30 10:58:33,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-30 10:58:33,501 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:33,501 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-09-30 10:58:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:34,056 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-30 10:58:34,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-30 10:58:34,057 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-09-30 10:58:34,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:34,057 INFO L225 Difference]: With dead ends: 77 [2018-09-30 10:58:34,058 INFO L226 Difference]: Without dead ends: 76 [2018-09-30 10:58:34,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-30 10:58:34,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-30 10:58:34,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-30 10:58:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-30 10:58:34,061 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-30 10:58:34,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:34,062 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-30 10:58:34,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-30 10:58:34,062 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-30 10:58:34,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-30 10:58:34,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:34,062 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-09-30 10:58:34,063 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:34,063 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:34,063 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-09-30 10:58:34,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:34,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:34,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:34,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:34,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:34,569 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:34,569 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:34,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:34,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:34,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:34,875 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:34,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-09-30 10:58:34,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-30 10:58:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-30 10:58:34,877 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:34,877 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-09-30 10:58:35,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:35,343 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-30 10:58:35,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-30 10:58:35,343 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-09-30 10:58:35,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:35,344 INFO L225 Difference]: With dead ends: 78 [2018-09-30 10:58:35,344 INFO L226 Difference]: Without dead ends: 77 [2018-09-30 10:58:35,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:35,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-30 10:58:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-30 10:58:35,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 10:58:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-30 10:58:35,348 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-30 10:58:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:35,348 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-30 10:58:35,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-30 10:58:35,348 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-30 10:58:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 10:58:35,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:35,349 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-09-30 10:58:35,349 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:35,349 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:35,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-09-30 10:58:35,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:35,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:35,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:35,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:35,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:36,065 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:36,066 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:36,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:36,114 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:36,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:36,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:36,268 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:36,268 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-09-30 10:58:36,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-30 10:58:36,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-30 10:58:36,270 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:36,270 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-09-30 10:58:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:36,689 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-30 10:58:36,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 10:58:36,690 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-09-30 10:58:36,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:36,691 INFO L225 Difference]: With dead ends: 79 [2018-09-30 10:58:36,691 INFO L226 Difference]: Without dead ends: 78 [2018-09-30 10:58:36,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:36,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-30 10:58:36,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-30 10:58:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-30 10:58:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-30 10:58:36,693 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-30 10:58:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:36,694 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-30 10:58:36,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-30 10:58:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-30 10:58:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-30 10:58:36,694 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:36,694 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-09-30 10:58:36,695 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:36,695 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-09-30 10:58:36,695 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:36,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:36,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:36,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:37,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:37,082 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:37,082 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:37,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:37,157 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-09-30 10:58:37,157 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:37,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:37,316 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:37,316 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-09-30 10:58:37,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-30 10:58:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-30 10:58:37,318 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:37,318 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-09-30 10:58:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:37,783 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-30 10:58:37,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-30 10:58:37,784 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-09-30 10:58:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:37,785 INFO L225 Difference]: With dead ends: 80 [2018-09-30 10:58:37,785 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 10:58:37,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:37,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 10:58:37,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-30 10:58:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-30 10:58:37,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-30 10:58:37,790 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-30 10:58:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:37,790 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-30 10:58:37,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-30 10:58:37,790 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-30 10:58:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-30 10:58:37,791 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:37,791 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-09-30 10:58:37,791 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:37,792 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:37,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-09-30 10:58:37,792 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:37,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:37,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:37,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:37,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:38,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:38,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:38,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:38,263 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:38,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:38,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:38,423 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:38,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-09-30 10:58:38,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-30 10:58:38,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-30 10:58:38,424 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:38,424 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-09-30 10:58:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:38,870 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-30 10:58:38,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-30 10:58:38,870 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-09-30 10:58:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:38,871 INFO L225 Difference]: With dead ends: 81 [2018-09-30 10:58:38,871 INFO L226 Difference]: Without dead ends: 80 [2018-09-30 10:58:38,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:38,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-30 10:58:38,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-30 10:58:38,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-30 10:58:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-30 10:58:38,873 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-30 10:58:38,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:38,874 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-30 10:58:38,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-30 10:58:38,874 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-30 10:58:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-30 10:58:38,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:38,874 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-09-30 10:58:38,874 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:38,875 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:38,875 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-09-30 10:58:38,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:38,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:38,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:38,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:39,276 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:39,276 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:39,282 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:39,351 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-09-30 10:58:39,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:39,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:39,523 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:39,523 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-09-30 10:58:39,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-30 10:58:39,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-30 10:58:39,524 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:39,524 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-09-30 10:58:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:40,223 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-30 10:58:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-30 10:58:40,223 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-09-30 10:58:40,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:40,224 INFO L225 Difference]: With dead ends: 82 [2018-09-30 10:58:40,224 INFO L226 Difference]: Without dead ends: 81 [2018-09-30 10:58:40,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:40,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-30 10:58:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-30 10:58:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 10:58:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-30 10:58:40,228 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-30 10:58:40,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:40,228 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-30 10:58:40,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-30 10:58:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-30 10:58:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 10:58:40,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:40,229 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-09-30 10:58:40,229 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:40,229 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:40,229 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-09-30 10:58:40,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:40,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:40,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:40,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:40,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:40,801 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:40,801 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:40,870 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-09-30 10:58:40,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:40,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:41,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:41,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:41,033 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-09-30 10:58:41,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-30 10:58:41,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-30 10:58:41,034 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:41,034 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-09-30 10:58:41,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:41,698 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-30 10:58:41,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-30 10:58:41,699 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-09-30 10:58:41,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:41,700 INFO L225 Difference]: With dead ends: 83 [2018-09-30 10:58:41,700 INFO L226 Difference]: Without dead ends: 82 [2018-09-30 10:58:41,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-30 10:58:41,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-30 10:58:41,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-30 10:58:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-30 10:58:41,703 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-30 10:58:41,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:41,704 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-30 10:58:41,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-30 10:58:41,704 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-30 10:58:41,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-30 10:58:41,704 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:41,704 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-09-30 10:58:41,705 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:41,705 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:41,705 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-09-30 10:58:41,705 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:41,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:41,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:41,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:42,470 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:42,470 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:42,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:42,702 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:42,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-09-30 10:58:42,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 10:58:42,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 10:58:42,703 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:42,704 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-09-30 10:58:43,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:43,346 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-30 10:58:43,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-30 10:58:43,346 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-09-30 10:58:43,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:43,347 INFO L225 Difference]: With dead ends: 84 [2018-09-30 10:58:43,347 INFO L226 Difference]: Without dead ends: 83 [2018-09-30 10:58:43,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-30 10:58:43,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-30 10:58:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-30 10:58:43,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-30 10:58:43,351 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-30 10:58:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:43,351 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-30 10:58:43,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 10:58:43,351 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-30 10:58:43,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-30 10:58:43,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:43,352 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-09-30 10:58:43,352 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:43,352 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-09-30 10:58:43,353 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:43,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:43,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:43,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:43,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:43,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:43,901 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:43,901 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:43,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:43,951 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:43,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:43,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:44,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:44,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-09-30 10:58:44,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-30 10:58:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-30 10:58:44,119 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:44,119 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-09-30 10:58:44,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:44,642 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-30 10:58:44,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-30 10:58:44,642 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-09-30 10:58:44,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:44,643 INFO L225 Difference]: With dead ends: 85 [2018-09-30 10:58:44,643 INFO L226 Difference]: Without dead ends: 84 [2018-09-30 10:58:44,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-30 10:58:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-30 10:58:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-30 10:58:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-30 10:58:44,647 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-30 10:58:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:44,647 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-30 10:58:44,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-30 10:58:44,648 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-30 10:58:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-30 10:58:44,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:44,648 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-09-30 10:58:44,649 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:44,649 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:44,649 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-09-30 10:58:44,649 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:44,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:44,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:45,240 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:45,240 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:45,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:45,322 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-09-30 10:58:45,322 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:45,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:46,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:46,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:46,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-09-30 10:58:46,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 10:58:46,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 10:58:46,451 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:46,452 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-09-30 10:58:47,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:47,073 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-30 10:58:47,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-30 10:58:47,073 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-09-30 10:58:47,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:47,074 INFO L225 Difference]: With dead ends: 86 [2018-09-30 10:58:47,074 INFO L226 Difference]: Without dead ends: 85 [2018-09-30 10:58:47,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-30 10:58:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-30 10:58:47,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-30 10:58:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-30 10:58:47,076 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-30 10:58:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:47,076 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-30 10:58:47,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 10:58:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-30 10:58:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-30 10:58:47,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:47,077 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-09-30 10:58:47,077 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:47,077 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-09-30 10:58:47,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:47,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:47,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:47,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:47,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:47,589 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:47,589 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:47,597 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:47,649 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:47,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:47,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:47,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:47,834 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:47,835 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-09-30 10:58:47,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-30 10:58:47,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-30 10:58:47,836 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:47,836 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. [2018-09-30 10:58:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:48,542 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-30 10:58:48,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-30 10:58:48,543 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 84 [2018-09-30 10:58:48,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:48,543 INFO L225 Difference]: With dead ends: 87 [2018-09-30 10:58:48,544 INFO L226 Difference]: Without dead ends: 86 [2018-09-30 10:58:48,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:48,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-30 10:58:48,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-30 10:58:48,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-30 10:58:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-30 10:58:48,547 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-30 10:58:48,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:48,548 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-30 10:58:48,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-30 10:58:48,548 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-30 10:58:48,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-30 10:58:48,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:48,548 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1] [2018-09-30 10:58:48,549 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:48,549 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:48,549 INFO L82 PathProgramCache]: Analyzing trace with hash -424691807, now seen corresponding path program 83 times [2018-09-30 10:58:48,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:48,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:48,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:49,063 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:49,063 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:49,071 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:49,145 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2018-09-30 10:58:49,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:49,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:49,370 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:49,370 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 84 [2018-09-30 10:58:49,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 10:58:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 10:58:49,371 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:49,371 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-09-30 10:58:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:50,169 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-30 10:58:50,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-30 10:58:50,169 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-09-30 10:58:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:50,170 INFO L225 Difference]: With dead ends: 88 [2018-09-30 10:58:50,170 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 10:58:50,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 10:58:50,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-30 10:58:50,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-30 10:58:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-30 10:58:50,173 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-30 10:58:50,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:50,174 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-30 10:58:50,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 10:58:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-30 10:58:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 10:58:50,174 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:50,174 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1] [2018-09-30 10:58:50,174 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:50,174 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:50,175 INFO L82 PathProgramCache]: Analyzing trace with hash -280544185, now seen corresponding path program 84 times [2018-09-30 10:58:50,175 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:50,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:50,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:50,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:50,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:50,736 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:50,736 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:50,744 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:58:50,822 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-30 10:58:50,822 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:50,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:51,002 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:51,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 85 [2018-09-30 10:58:51,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-30 10:58:51,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-30 10:58:51,003 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:51,004 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 87 states. [2018-09-30 10:58:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:52,318 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-30 10:58:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-30 10:58:52,318 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 86 [2018-09-30 10:58:52,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:52,319 INFO L225 Difference]: With dead ends: 89 [2018-09-30 10:58:52,319 INFO L226 Difference]: Without dead ends: 88 [2018-09-30 10:58:52,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-30 10:58:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-30 10:58:52,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-30 10:58:52,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-30 10:58:52,322 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-30 10:58:52,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:52,323 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-30 10:58:52,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-30 10:58:52,323 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-30 10:58:52,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-30 10:58:52,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:52,324 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1] [2018-09-30 10:58:52,324 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:52,325 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:52,325 INFO L82 PathProgramCache]: Analyzing trace with hash -106935199, now seen corresponding path program 85 times [2018-09-30 10:58:52,325 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:52,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:52,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:52,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:52,777 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:52,777 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:52,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:52,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:53,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:53,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:53,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 86 [2018-09-30 10:58:53,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-30 10:58:53,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-30 10:58:53,132 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:53,132 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-09-30 10:58:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:53,885 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-30 10:58:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-30 10:58:53,885 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-09-30 10:58:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:53,886 INFO L225 Difference]: With dead ends: 90 [2018-09-30 10:58:53,886 INFO L226 Difference]: Without dead ends: 89 [2018-09-30 10:58:53,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-30 10:58:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-30 10:58:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-30 10:58:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-30 10:58:53,891 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-30 10:58:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:53,891 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-30 10:58:53,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-30 10:58:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-30 10:58:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-30 10:58:53,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:53,892 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1] [2018-09-30 10:58:53,892 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:53,892 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash 979976071, now seen corresponding path program 86 times [2018-09-30 10:58:53,892 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:53,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:53,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:58:53,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:54,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:54,360 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:54,361 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:54,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:58:54,414 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:58:54,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:54,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:54,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:54,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:54,595 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 87 [2018-09-30 10:58:54,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-30 10:58:54,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-30 10:58:54,596 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:54,596 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 89 states. [2018-09-30 10:58:55,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:55,430 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-30 10:58:55,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-30 10:58:55,431 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 88 [2018-09-30 10:58:55,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:55,432 INFO L225 Difference]: With dead ends: 91 [2018-09-30 10:58:55,432 INFO L226 Difference]: Without dead ends: 90 [2018-09-30 10:58:55,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-30 10:58:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-30 10:58:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-30 10:58:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-30 10:58:55,435 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-30 10:58:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:55,435 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-30 10:58:55,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-30 10:58:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-30 10:58:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-30 10:58:55,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:55,436 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1] [2018-09-30 10:58:55,436 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:55,436 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash 314487073, now seen corresponding path program 87 times [2018-09-30 10:58:55,436 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:55,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:55,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:55,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:55,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:55,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:55,918 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:55,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:58:56,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-09-30 10:58:56,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:56,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:56,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:56,207 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:56,207 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 88 [2018-09-30 10:58:56,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-30 10:58:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-30 10:58:56,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:56,209 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-09-30 10:58:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:56,976 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-30 10:58:56,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-30 10:58:56,976 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-09-30 10:58:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:56,977 INFO L225 Difference]: With dead ends: 92 [2018-09-30 10:58:56,977 INFO L226 Difference]: Without dead ends: 91 [2018-09-30 10:58:56,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:56,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-30 10:58:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-30 10:58:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-30 10:58:56,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-30 10:58:56,980 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-30 10:58:56,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:56,980 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-30 10:58:56,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-30 10:58:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-30 10:58:56,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 10:58:56,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:56,981 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1] [2018-09-30 10:58:56,981 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:56,981 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:56,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164615, now seen corresponding path program 88 times [2018-09-30 10:58:56,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:56,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:56,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:56,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:57,464 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:57,464 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:57,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:58:57,523 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:58:57,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:57,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:57,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:57,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:57,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 89 [2018-09-30 10:58:57,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-30 10:58:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-30 10:58:57,707 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:57,707 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 91 states. [2018-09-30 10:58:58,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:58:58,466 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-30 10:58:58,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-30 10:58:58,467 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 90 [2018-09-30 10:58:58,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:58:58,467 INFO L225 Difference]: With dead ends: 93 [2018-09-30 10:58:58,468 INFO L226 Difference]: Without dead ends: 92 [2018-09-30 10:58:58,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:58:58,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-30 10:58:58,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-30 10:58:58,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-30 10:58:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-30 10:58:58,470 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-30 10:58:58,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:58:58,471 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-30 10:58:58,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-30 10:58:58,471 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-30 10:58:58,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-30 10:58:58,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:58:58,471 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1] [2018-09-30 10:58:58,471 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:58:58,471 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:58:58,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364641, now seen corresponding path program 89 times [2018-09-30 10:58:58,472 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:58:58,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:58:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:58,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:58:58,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:58:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:58:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:59,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:58:59,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:58:59,063 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:58:59,146 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2018-09-30 10:58:59,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:58:59,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:58:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:58:59,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:58:59,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 90 [2018-09-30 10:58:59,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 10:58:59,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 10:58:59,338 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:58:59,338 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-09-30 10:59:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:00,428 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-30 10:59:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-30 10:59:00,428 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-09-30 10:59:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:00,429 INFO L225 Difference]: With dead ends: 94 [2018-09-30 10:59:00,429 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 10:59:00,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:00,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 10:59:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-30 10:59:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 10:59:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-30 10:59:00,432 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-30 10:59:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:00,432 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-30 10:59:00,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 10:59:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-30 10:59:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 10:59:00,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:00,433 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1] [2018-09-30 10:59:00,434 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:00,434 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:00,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663559, now seen corresponding path program 90 times [2018-09-30 10:59:00,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:00,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:00,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:00,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:00,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:00,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:00,952 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:00,952 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:00,960 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:59:01,124 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2018-09-30 10:59:01,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:01,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:01,378 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:01,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 91 [2018-09-30 10:59:01,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-30 10:59:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-30 10:59:01,380 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:01,380 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 93 states. [2018-09-30 10:59:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:02,297 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-30 10:59:02,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-30 10:59:02,297 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-09-30 10:59:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:02,298 INFO L225 Difference]: With dead ends: 95 [2018-09-30 10:59:02,298 INFO L226 Difference]: Without dead ends: 94 [2018-09-30 10:59:02,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:02,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-30 10:59:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-30 10:59:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-30 10:59:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-30 10:59:02,301 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-30 10:59:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:02,302 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-30 10:59:02,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-30 10:59:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-30 10:59:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-30 10:59:02,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:02,302 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1] [2018-09-30 10:59:02,302 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:02,302 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930017, now seen corresponding path program 91 times [2018-09-30 10:59:02,303 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:02,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:02,829 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:02,829 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:02,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:59:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:02,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:03,077 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:03,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 92 [2018-09-30 10:59:03,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-30 10:59:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-30 10:59:03,079 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:03,079 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-09-30 10:59:03,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:03,960 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-30 10:59:03,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-30 10:59:03,961 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-09-30 10:59:03,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:03,961 INFO L225 Difference]: With dead ends: 96 [2018-09-30 10:59:03,962 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 10:59:03,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 10:59:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-30 10:59:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-30 10:59:03,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-30 10:59:03,965 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-30 10:59:03,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:03,965 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-30 10:59:03,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-30 10:59:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-30 10:59:03,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-30 10:59:03,966 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:03,966 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1] [2018-09-30 10:59:03,966 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:03,966 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash 854092103, now seen corresponding path program 92 times [2018-09-30 10:59:03,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:03,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:03,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:03,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:59:03,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:04,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:04,492 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:04,492 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:04,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:59:04,552 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:59:04,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:04,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:04,744 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:04,744 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 93 [2018-09-30 10:59:04,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-30 10:59:04,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-30 10:59:04,746 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:04,746 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 95 states. [2018-09-30 10:59:05,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:05,466 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-30 10:59:05,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-30 10:59:05,467 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 94 [2018-09-30 10:59:05,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:05,468 INFO L225 Difference]: With dead ends: 97 [2018-09-30 10:59:05,468 INFO L226 Difference]: Without dead ends: 96 [2018-09-30 10:59:05,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-30 10:59:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-30 10:59:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-30 10:59:05,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-30 10:59:05,470 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-30 10:59:05,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:05,470 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-30 10:59:05,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-30 10:59:05,470 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-30 10:59:05,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-30 10:59:05,471 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:05,471 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1] [2018-09-30 10:59:05,471 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:05,471 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:05,471 INFO L82 PathProgramCache]: Analyzing trace with hash 707051361, now seen corresponding path program 93 times [2018-09-30 10:59:05,471 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:05,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:05,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:05,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:05,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:06,017 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:06,018 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:06,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:06,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:59:06,113 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-09-30 10:59:06,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:06,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:06,310 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:06,310 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 94 [2018-09-30 10:59:06,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-30 10:59:06,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-30 10:59:06,312 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:06,312 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-09-30 10:59:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:07,099 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-30 10:59:07,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-30 10:59:07,099 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-09-30 10:59:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:07,100 INFO L225 Difference]: With dead ends: 98 [2018-09-30 10:59:07,100 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 10:59:07,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:07,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 10:59:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-30 10:59:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 10:59:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-30 10:59:07,104 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-30 10:59:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:07,104 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-30 10:59:07,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-30 10:59:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-30 10:59:07,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 10:59:07,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:07,105 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1] [2018-09-30 10:59:07,105 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:07,105 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:07,105 INFO L82 PathProgramCache]: Analyzing trace with hash 443755655, now seen corresponding path program 94 times [2018-09-30 10:59:07,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:07,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:07,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:07,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:07,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:07,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:07,856 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:07,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:07,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:59:07,918 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:59:07,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:07,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:08,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:08,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 95 [2018-09-30 10:59:08,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-30 10:59:08,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-30 10:59:08,167 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:08,167 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 97 states. [2018-09-30 10:59:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:09,057 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-30 10:59:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-30 10:59:09,058 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 96 [2018-09-30 10:59:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:09,059 INFO L225 Difference]: With dead ends: 99 [2018-09-30 10:59:09,059 INFO L226 Difference]: Without dead ends: 98 [2018-09-30 10:59:09,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:09,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-30 10:59:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-30 10:59:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-30 10:59:09,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-30 10:59:09,061 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-30 10:59:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:09,061 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-30 10:59:09,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-30 10:59:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-30 10:59:09,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-30 10:59:09,062 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:09,062 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1] [2018-09-30 10:59:09,062 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:09,062 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:09,063 INFO L82 PathProgramCache]: Analyzing trace with hash 871523361, now seen corresponding path program 95 times [2018-09-30 10:59:09,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:09,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:09,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:09,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:09,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:09,613 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:09,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:09,622 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 10:59:09,712 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2018-09-30 10:59:09,713 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:09,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:09,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:09,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 96 [2018-09-30 10:59:09,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-30 10:59:09,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-30 10:59:09,955 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:09,956 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-09-30 10:59:10,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:10,779 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-30 10:59:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-30 10:59:10,780 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-09-30 10:59:10,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:10,781 INFO L225 Difference]: With dead ends: 100 [2018-09-30 10:59:10,781 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 10:59:10,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:10,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 10:59:10,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-30 10:59:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-30 10:59:10,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-30 10:59:10,784 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-30 10:59:10,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:10,784 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-30 10:59:10,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-30 10:59:10,785 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-30 10:59:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-30 10:59:10,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:10,785 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1] [2018-09-30 10:59:10,786 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:10,786 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:10,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420359, now seen corresponding path program 96 times [2018-09-30 10:59:10,786 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:10,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:10,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:10,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:10,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:11,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:11,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:11,387 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:11,394 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 10:59:11,485 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-30 10:59:11,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:11,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:11,680 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:11,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 97 [2018-09-30 10:59:11,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-30 10:59:11,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-30 10:59:11,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:11,682 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 99 states. [2018-09-30 10:59:12,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:12,415 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-30 10:59:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-30 10:59:12,416 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 98 [2018-09-30 10:59:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:12,417 INFO L225 Difference]: With dead ends: 101 [2018-09-30 10:59:12,417 INFO L226 Difference]: Without dead ends: 100 [2018-09-30 10:59:12,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-30 10:59:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-30 10:59:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-30 10:59:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-30 10:59:12,419 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-30 10:59:12,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:12,419 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-30 10:59:12,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-30 10:59:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-30 10:59:12,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-30 10:59:12,421 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:12,421 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1] [2018-09-30 10:59:12,421 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:12,422 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:12,422 INFO L82 PathProgramCache]: Analyzing trace with hash 15325409, now seen corresponding path program 97 times [2018-09-30 10:59:12,422 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:12,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:12,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:12,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:12,989 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:12,989 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:12,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:59:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:13,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:13,241 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:13,241 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 98 [2018-09-30 10:59:13,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 10:59:13,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 10:59:13,242 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:13,243 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-09-30 10:59:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:14,229 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-30 10:59:14,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-30 10:59:14,230 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-09-30 10:59:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:14,231 INFO L225 Difference]: With dead ends: 102 [2018-09-30 10:59:14,231 INFO L226 Difference]: Without dead ends: 101 [2018-09-30 10:59:14,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-30 10:59:14,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-30 10:59:14,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-30 10:59:14,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-30 10:59:14,234 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-30 10:59:14,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:14,234 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-30 10:59:14,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 10:59:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-30 10:59:14,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-30 10:59:14,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:14,235 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1] [2018-09-30 10:59:14,235 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:14,235 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 475087623, now seen corresponding path program 98 times [2018-09-30 10:59:14,235 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:14,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:14,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 10:59:14,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:14,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:14,813 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:14,813 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:14,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 10:59:14,873 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 10:59:14,873 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:14,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:15,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:15,075 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:15,075 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 99 [2018-09-30 10:59:15,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-30 10:59:15,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-30 10:59:15,077 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:15,077 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 101 states. [2018-09-30 10:59:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:16,039 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-30 10:59:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-30 10:59:16,040 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 100 [2018-09-30 10:59:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:16,041 INFO L225 Difference]: With dead ends: 103 [2018-09-30 10:59:16,041 INFO L226 Difference]: Without dead ends: 102 [2018-09-30 10:59:16,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:16,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-30 10:59:16,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-30 10:59:16,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-30 10:59:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-30 10:59:16,044 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-30 10:59:16,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:16,044 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-30 10:59:16,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-30 10:59:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-30 10:59:16,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-30 10:59:16,045 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:16,045 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1] [2018-09-30 10:59:16,045 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:16,045 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:16,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814369, now seen corresponding path program 99 times [2018-09-30 10:59:16,045 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:16,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:16,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:16,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:16,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:16,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:16,655 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:16,655 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:16,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 10:59:16,761 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-09-30 10:59:16,761 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:16,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:16,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:16,967 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 100 [2018-09-30 10:59:16,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-30 10:59:16,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-30 10:59:16,968 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:16,968 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-09-30 10:59:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 10:59:17,907 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-30 10:59:17,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-30 10:59:17,907 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-09-30 10:59:17,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 10:59:17,908 INFO L225 Difference]: With dead ends: 104 [2018-09-30 10:59:17,908 INFO L226 Difference]: Without dead ends: 103 [2018-09-30 10:59:17,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 10:59:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-30 10:59:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-30 10:59:17,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-30 10:59:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-30 10:59:17,912 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-30 10:59:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 10:59:17,912 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-30 10:59:17,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-30 10:59:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-30 10:59:17,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 10:59:17,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 10:59:17,913 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1] [2018-09-30 10:59:17,913 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 10:59:17,913 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 10:59:17,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670535, now seen corresponding path program 100 times [2018-09-30 10:59:17,913 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 10:59:17,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 10:59:17,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:17,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 10:59:17,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 10:59:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 10:59:26,404 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:26,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 10:59:26,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 10:59:26,416 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 10:59:26,479 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 10:59:26,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 10:59:26,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 10:59:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 10:59:27,139 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 10:59:27,139 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 101 [2018-09-30 10:59:27,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-30 10:59:27,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-30 10:59:27,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 10:59:27,140 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 103 states. [2018-09-30 11:00:00,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:00:00,440 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-30 11:00:00,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-30 11:00:00,441 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 102 [2018-09-30 11:00:00,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:00:00,442 INFO L225 Difference]: With dead ends: 105 [2018-09-30 11:00:00,442 INFO L226 Difference]: Without dead ends: 104 [2018-09-30 11:00:00,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:00:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-30 11:00:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-30 11:00:00,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-30 11:00:00,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-30 11:00:00,448 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-30 11:00:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:00:00,449 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-30 11:00:00,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-30 11:00:00,449 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-30 11:00:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-30 11:00:00,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 11:00:00,450 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1] [2018-09-30 11:00:00,450 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 11:00:00,450 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-30 11:00:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080865, now seen corresponding path program 101 times [2018-09-30 11:00:00,450 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 11:00:00,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 11:00:00,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:00,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 11:00:00,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 11:00:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 11:00:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 5151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 11:00:02,738 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 11:00:02,738 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [102] imperfect sequences [] total 102 [2018-09-30 11:00:02,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-30 11:00:02,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-30 11:00:02,739 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-30 11:00:02,739 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-09-30 11:00:03,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 11:00:03,780 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-30 11:00:03,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-30 11:00:03,780 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-09-30 11:00:03,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 11:00:03,781 INFO L225 Difference]: With dead ends: 104 [2018-09-30 11:00:03,781 INFO L226 Difference]: Without dead ends: 0 [2018-09-30 11:00:03,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-30 11:00:03,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-30 11:00:03,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-30 11:00:03,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-30 11:00:03,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-30 11:00:03,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2018-09-30 11:00:03,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 11:00:03,783 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-30 11:00:03,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-30 11:00:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-30 11:00:03,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-30 11:00:03,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-30 11:00:03,955 WARN L178 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 613 [2018-09-30 11:00:07,582 WARN L178 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 613 DAG size of output: 610 [2018-09-30 11:00:07,591 INFO L426 ceAbstractionStarter]: For program point mainENTRY(lines 17 31) no Hoare annotation was computed. [2018-09-30 11:00:07,591 INFO L426 ceAbstractionStarter]: For program point mainFINAL(lines 17 31) no Hoare annotation was computed. [2018-09-30 11:00:07,591 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 17 31) no Hoare annotation was computed. [2018-09-30 11:00:07,593 INFO L422 ceAbstractionStarter]: At program point L24-1(lines 24 27) the Hoare annotation is: (or (and (<= 8 main_y) (<= main_y 8) (<= main_x 8) (<= 8 main_x)) (and (<= main_x 49) (<= main_y 49) (<= 49 main_x) (<= 49 main_y)) (and (<= 99 main_x) (<= main_y 99) (<= 99 main_y) (<= main_x 99)) (and (<= 42 main_x) (<= main_y 42) (<= main_x 42) (<= 42 main_y)) (and (<= 9 main_y) (<= 9 main_x) (<= main_x 9) (<= main_y 9)) (and (<= 59 main_x) (<= 59 main_y) (<= main_y 59) (<= main_x 59)) (and (<= 55 main_y) (<= main_y 55) (<= 55 main_x) (<= main_x 55)) (and (<= 74 main_x) (<= main_x 74) (<= 74 main_y) (<= main_y 74)) (and (<= main_x 97) (<= 97 main_y) (<= main_y 97) (<= 97 main_x)) (and (<= 12 main_x) (<= 12 main_y) (<= main_y 12) (<= main_x 12)) (and (<= main_x 65) (<= main_y 65) (<= 65 main_x) (<= 65 main_y)) (and (<= 32 main_x) (<= main_x 32) (<= 32 main_y) (<= main_y 32)) (and (<= main_y 73) (<= main_x 73) (<= 73 main_x) (<= 73 main_y)) (and (<= 6 main_x) (<= main_x 6) (<= 6 main_y) (<= main_y 6)) (and (<= 14 main_x) (<= 14 main_y) (<= main_y 14) (<= main_x 14)) (and (<= main_x 0) (<= 0 main_y) (<= 0 main_x) (<= main_y 0)) (and (<= main_y 44) (<= main_x 44) (<= 44 main_y) (<= 44 main_x)) (and (<= 38 main_x) (<= 38 main_y) (<= main_y 38) (<= main_x 38)) (and (<= 43 main_x) (<= main_x 43) (<= main_y 43) (<= 43 main_y)) (and (<= 21 main_y) (<= 21 main_x) (<= main_x 21) (<= main_y 21)) (and (<= 94 main_x) (<= 94 main_y) (<= main_x 94) (<= main_y 94)) (and (<= 52 main_x) (<= 52 main_y) (<= main_y 52) (<= main_x 52)) (and (<= main_y 46) (<= 46 main_x) (<= main_x 46) (<= 46 main_y)) (and (<= main_x 18) (<= 18 main_y) (<= 18 main_x) (<= main_y 18)) (<= 101 main_x) (and (<= 61 main_y) (<= main_x 61) (<= main_y 61) (<= 61 main_x)) (and (<= 88 main_y) (<= main_y 88) (<= 88 main_x) (<= main_x 88)) (and (<= 80 main_y) (<= main_x 80) (<= main_y 80) (<= 80 main_x)) (and (<= main_x 92) (<= 92 main_y) (<= main_y 92) (<= 92 main_x)) (and (<= 87 main_x) (<= main_x 87) (<= 87 main_y) (<= main_y 87)) (and (<= 35 main_y) (<= main_y 35) (<= main_x 35) (<= 35 main_x)) (and (<= 85 main_x) (<= main_x 85) (<= 85 main_y) (<= main_y 85)) (and (<= 63 main_x) (<= 63 main_y) (<= main_y 63) (<= main_x 63)) (and (<= 15 main_y) (<= main_y 15) (<= 15 main_x) (<= main_x 15)) (and (<= main_y 64) (<= 64 main_x) (<= main_x 64) (<= 64 main_y)) (and (<= 4 main_y) (<= main_y 4) (<= main_x 4) (<= 4 main_x)) (and (<= 47 main_x) (<= 47 main_y) (<= main_y 47) (<= main_x 47)) (and (<= 51 main_y) (<= main_x 51) (<= 51 main_x) (<= main_y 51)) (and (<= 54 main_y) (<= main_y 54) (<= 54 main_x) (<= main_x 54)) (and (<= main_x 33) (<= 33 main_x) (<= main_y 33) (<= 33 main_y)) (and (<= 37 main_x) (<= 37 main_y) (<= main_y 37) (<= main_x 37)) (and (<= 20 main_y) (<= 20 main_x) (<= main_y 20) (<= main_x 20)) (and (<= 26 main_y) (<= main_x 26) (<= 26 main_x) (<= main_y 26)) (and (<= 86 main_x) (<= 86 main_y) (<= main_x 86) (<= main_y 86)) (and (<= main_x 27) (<= main_y 27) (<= 27 main_y) (<= 27 main_x)) (and (<= main_y 95) (<= 95 main_x) (<= 95 main_y) (<= main_x 95)) (and (<= 1 main_x) (<= main_x 1) (<= main_y 1) (<= 1 main_y)) (and (<= main_x 56) (<= 56 main_x) (<= 56 main_y) (<= main_y 56)) (and (<= main_y 75) (<= main_x 75) (<= 75 main_y) (<= 75 main_x)) (and (<= 68 main_y) (<= main_x 68) (<= main_y 68) (<= 68 main_x)) (and (<= main_x 62) (<= 62 main_x) (<= 62 main_y) (<= main_y 62)) (and (<= main_y 78) (<= 78 main_x) (<= 78 main_y) (<= main_x 78)) (and (<= main_y 3) (<= 3 main_y) (<= 3 main_x) (<= main_x 3)) (and (<= main_x 25) (<= main_y 25) (<= 25 main_x) (<= 25 main_y)) (and (<= main_x 36) (<= main_y 36) (<= 36 main_x) (<= 36 main_y)) (and (<= 57 main_y) (<= main_x 57) (<= main_y 57) (<= 57 main_x)) (and (<= 5 main_x) (<= main_x 5) (<= main_y 5) (<= 5 main_y)) (and (<= 82 main_x) (<= 82 main_y) (<= main_x 82) (<= main_y 82)) (and (<= main_y 17) (<= 17 main_y) (<= 17 main_x) (<= main_x 17)) (and (<= main_y 83) (<= 83 main_x) (<= main_x 83) (<= 83 main_y)) (and (<= 77 main_x) (<= 77 main_y) (<= main_x 77) (<= main_y 77)) (and (<= 31 main_x) (<= 31 main_y) (<= main_y 31) (<= main_x 31)) (and (<= main_y 98) (<= main_x 98) (<= 98 main_y) (<= 98 main_x)) (and (<= 71 main_y) (<= 71 main_x) (<= main_y 71) (<= main_x 71)) (and (<= main_y 41) (<= 41 main_x) (<= 41 main_y) (<= main_x 41)) (and (<= 30 main_x) (<= 30 main_y) (<= main_x 30) (<= main_y 30)) (and (<= 24 main_y) (<= main_x 24) (<= main_y 24) (<= 24 main_x)) (and (<= main_y 50) (<= 50 main_y) (<= main_x 50) (<= 50 main_x)) (and (<= 84 main_y) (<= main_y 84) (<= main_x 84) (<= 84 main_x)) (and (<= main_y 93) (<= 93 main_y) (<= 93 main_x) (<= main_x 93)) (and (<= main_y 60) (<= main_x 60) (<= 60 main_y) (<= 60 main_x)) (and (<= 29 main_y) (<= main_x 29) (<= 29 main_x) (<= main_y 29)) (and (<= main_y 40) (<= main_x 40) (<= 40 main_y) (<= 40 main_x)) (and (<= main_y 53) (<= 53 main_y) (<= main_x 53) (<= 53 main_x)) (and (<= main_y 58) (<= 58 main_y) (<= 58 main_x) (<= main_x 58)) (and (<= 67 main_x) (<= 67 main_y) (<= main_y 67) (<= main_x 67)) (and (<= main_y 22) (<= main_x 22) (<= 22 main_x) (<= 22 main_y)) (and (<= 39 main_y) (<= 39 main_x) (<= main_x 39) (<= main_y 39)) (and (<= 13 main_x) (<= main_x 13) (<= main_y 13) (<= 13 main_y)) (and (<= main_y 100) (< 99 main_y) (<= 100 main_x)) (and (<= main_y 79) (<= 79 main_x) (<= main_x 79) (<= 79 main_y)) (and (<= 69 main_x) (<= main_x 69) (<= 69 main_y) (<= main_y 69)) (and (<= 81 main_x) (<= main_y 81) (<= main_x 81) (<= 81 main_y)) (and (<= 28 main_y) (<= main_x 28) (<= 28 main_x) (<= main_y 28)) (and (<= main_x 91) (<= 91 main_y) (<= 91 main_x) (<= main_y 91)) (and (<= main_y 66) (<= main_x 66) (<= 66 main_x) (<= 66 main_y)) (and (<= 34 main_x) (<= main_y 34) (<= main_x 34) (<= 34 main_y)) (and (<= 89 main_x) (<= main_y 89) (<= main_x 89) (<= 89 main_y)) (and (<= 10 main_y) (<= main_x 10) (<= main_y 10) (<= 10 main_x)) (and (<= main_x 16) (<= main_y 16) (<= 16 main_x) (<= 16 main_y)) (and (<= 2 main_y) (<= 2 main_x) (<= main_y 2) (<= main_x 2)) (and (<= main_x 7) (<= 7 main_y) (<= 7 main_x) (<= main_y 7)) (and (<= main_x 72) (<= 72 main_x) (<= 72 main_y) (<= main_y 72)) (and (<= 48 main_x) (<= main_x 48) (<= main_y 48) (<= 48 main_y)) (and (<= main_y 76) (<= main_x 76) (<= 76 main_y) (<= 76 main_x)) (and (<= 96 main_x) (<= main_y 96) (<= 96 main_y) (<= main_x 96)) (and (<= 45 main_x) (<= 45 main_y) (<= main_y 45) (<= main_x 45)) (and (<= 11 main_x) (<= main_x 11) (<= 11 main_y) (<= main_y 11)) (and (<= 90 main_x) (<= main_y 90) (<= 90 main_y) (<= main_x 90)) (and (<= main_x 19) (<= main_y 19) (<= 19 main_x) (<= 19 main_y)) (and (<= main_x 70) (<= main_y 70) (<= 70 main_x) (<= 70 main_y)) (and (<= 23 main_x) (<= 23 main_y) (<= main_y 23) (<= main_x 23))) [2018-09-30 11:00:07,593 INFO L426 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 29) no Hoare annotation was computed. [2018-09-30 11:00:07,630 INFO L202 PluginConnector]: Adding new model HiddenEquality-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 11:00:07 BoogieIcfgContainer [2018-09-30 11:00:07,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 11:00:07,631 INFO L168 Benchmark]: Toolchain (without parser) took 156254.84 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 299.9 MB). Free memory was 1.5 GB in the beginning and 997.3 MB in the end (delta: 470.9 MB). Peak memory consumption was 770.8 MB. Max. memory is 7.1 GB. [2018-09-30 11:00:07,632 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 11:00:07,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 11:00:07,633 INFO L168 Benchmark]: Boogie Preprocessor took 19.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-30 11:00:07,634 INFO L168 Benchmark]: RCFGBuilder took 259.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-30 11:00:07,634 INFO L168 Benchmark]: TraceAbstraction took 155928.02 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 299.9 MB). Free memory was 1.4 GB in the beginning and 997.3 MB in the end (delta: 449.8 MB). Peak memory consumption was 749.7 MB. Max. memory is 7.1 GB. [2018-09-30 11:00:07,637 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.26 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.99 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 259.08 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 155928.02 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 299.9 MB). Free memory was 1.4 GB in the beginning and 997.3 MB in the end (delta: 449.8 MB). Peak memory consumption was 749.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 29]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((8 <= y && y <= 8) && x <= 8) && 8 <= x) || (((x <= 49 && y <= 49) && 49 <= x) && 49 <= y)) || (((99 <= x && y <= 99) && 99 <= y) && x <= 99)) || (((42 <= x && y <= 42) && x <= 42) && 42 <= y)) || (((9 <= y && 9 <= x) && x <= 9) && y <= 9)) || (((59 <= x && 59 <= y) && y <= 59) && x <= 59)) || (((55 <= y && y <= 55) && 55 <= x) && x <= 55)) || (((74 <= x && x <= 74) && 74 <= y) && y <= 74)) || (((x <= 97 && 97 <= y) && y <= 97) && 97 <= x)) || (((12 <= x && 12 <= y) && y <= 12) && x <= 12)) || (((x <= 65 && y <= 65) && 65 <= x) && 65 <= y)) || (((32 <= x && x <= 32) && 32 <= y) && y <= 32)) || (((y <= 73 && x <= 73) && 73 <= x) && 73 <= y)) || (((6 <= x && x <= 6) && 6 <= y) && y <= 6)) || (((14 <= x && 14 <= y) && y <= 14) && x <= 14)) || (((x <= 0 && 0 <= y) && 0 <= x) && y <= 0)) || (((y <= 44 && x <= 44) && 44 <= y) && 44 <= x)) || (((38 <= x && 38 <= y) && y <= 38) && x <= 38)) || (((43 <= x && x <= 43) && y <= 43) && 43 <= y)) || (((21 <= y && 21 <= x) && x <= 21) && y <= 21)) || (((94 <= x && 94 <= y) && x <= 94) && y <= 94)) || (((52 <= x && 52 <= y) && y <= 52) && x <= 52)) || (((y <= 46 && 46 <= x) && x <= 46) && 46 <= y)) || (((x <= 18 && 18 <= y) && 18 <= x) && y <= 18)) || 101 <= x) || (((61 <= y && x <= 61) && y <= 61) && 61 <= x)) || (((88 <= y && y <= 88) && 88 <= x) && x <= 88)) || (((80 <= y && x <= 80) && y <= 80) && 80 <= x)) || (((x <= 92 && 92 <= y) && y <= 92) && 92 <= x)) || (((87 <= x && x <= 87) && 87 <= y) && y <= 87)) || (((35 <= y && y <= 35) && x <= 35) && 35 <= x)) || (((85 <= x && x <= 85) && 85 <= y) && y <= 85)) || (((63 <= x && 63 <= y) && y <= 63) && x <= 63)) || (((15 <= y && y <= 15) && 15 <= x) && x <= 15)) || (((y <= 64 && 64 <= x) && x <= 64) && 64 <= y)) || (((4 <= y && y <= 4) && x <= 4) && 4 <= x)) || (((47 <= x && 47 <= y) && y <= 47) && x <= 47)) || (((51 <= y && x <= 51) && 51 <= x) && y <= 51)) || (((54 <= y && y <= 54) && 54 <= x) && x <= 54)) || (((x <= 33 && 33 <= x) && y <= 33) && 33 <= y)) || (((37 <= x && 37 <= y) && y <= 37) && x <= 37)) || (((20 <= y && 20 <= x) && y <= 20) && x <= 20)) || (((26 <= y && x <= 26) && 26 <= x) && y <= 26)) || (((86 <= x && 86 <= y) && x <= 86) && y <= 86)) || (((x <= 27 && y <= 27) && 27 <= y) && 27 <= x)) || (((y <= 95 && 95 <= x) && 95 <= y) && x <= 95)) || (((1 <= x && x <= 1) && y <= 1) && 1 <= y)) || (((x <= 56 && 56 <= x) && 56 <= y) && y <= 56)) || (((y <= 75 && x <= 75) && 75 <= y) && 75 <= x)) || (((68 <= y && x <= 68) && y <= 68) && 68 <= x)) || (((x <= 62 && 62 <= x) && 62 <= y) && y <= 62)) || (((y <= 78 && 78 <= x) && 78 <= y) && x <= 78)) || (((y <= 3 && 3 <= y) && 3 <= x) && x <= 3)) || (((x <= 25 && y <= 25) && 25 <= x) && 25 <= y)) || (((x <= 36 && y <= 36) && 36 <= x) && 36 <= y)) || (((57 <= y && x <= 57) && y <= 57) && 57 <= x)) || (((5 <= x && x <= 5) && y <= 5) && 5 <= y)) || (((82 <= x && 82 <= y) && x <= 82) && y <= 82)) || (((y <= 17 && 17 <= y) && 17 <= x) && x <= 17)) || (((y <= 83 && 83 <= x) && x <= 83) && 83 <= y)) || (((77 <= x && 77 <= y) && x <= 77) && y <= 77)) || (((31 <= x && 31 <= y) && y <= 31) && x <= 31)) || (((y <= 98 && x <= 98) && 98 <= y) && 98 <= x)) || (((71 <= y && 71 <= x) && y <= 71) && x <= 71)) || (((y <= 41 && 41 <= x) && 41 <= y) && x <= 41)) || (((30 <= x && 30 <= y) && x <= 30) && y <= 30)) || (((24 <= y && x <= 24) && y <= 24) && 24 <= x)) || (((y <= 50 && 50 <= y) && x <= 50) && 50 <= x)) || (((84 <= y && y <= 84) && x <= 84) && 84 <= x)) || (((y <= 93 && 93 <= y) && 93 <= x) && x <= 93)) || (((y <= 60 && x <= 60) && 60 <= y) && 60 <= x)) || (((29 <= y && x <= 29) && 29 <= x) && y <= 29)) || (((y <= 40 && x <= 40) && 40 <= y) && 40 <= x)) || (((y <= 53 && 53 <= y) && x <= 53) && 53 <= x)) || (((y <= 58 && 58 <= y) && 58 <= x) && x <= 58)) || (((67 <= x && 67 <= y) && y <= 67) && x <= 67)) || (((y <= 22 && x <= 22) && 22 <= x) && 22 <= y)) || (((39 <= y && 39 <= x) && x <= 39) && y <= 39)) || (((13 <= x && x <= 13) && y <= 13) && 13 <= y)) || ((y <= 100 && 99 < y) && 100 <= x)) || (((y <= 79 && 79 <= x) && x <= 79) && 79 <= y)) || (((69 <= x && x <= 69) && 69 <= y) && y <= 69)) || (((81 <= x && y <= 81) && x <= 81) && 81 <= y)) || (((28 <= y && x <= 28) && 28 <= x) && y <= 28)) || (((x <= 91 && 91 <= y) && 91 <= x) && y <= 91)) || (((y <= 66 && x <= 66) && 66 <= x) && 66 <= y)) || (((34 <= x && y <= 34) && x <= 34) && 34 <= y)) || (((89 <= x && y <= 89) && x <= 89) && 89 <= y)) || (((10 <= y && x <= 10) && y <= 10) && 10 <= x)) || (((x <= 16 && y <= 16) && 16 <= x) && 16 <= y)) || (((2 <= y && 2 <= x) && y <= 2) && x <= 2)) || (((x <= 7 && 7 <= y) && 7 <= x) && y <= 7)) || (((x <= 72 && 72 <= x) && 72 <= y) && y <= 72)) || (((48 <= x && x <= 48) && y <= 48) && 48 <= y)) || (((y <= 76 && x <= 76) && 76 <= y) && 76 <= x)) || (((96 <= x && y <= 96) && 96 <= y) && x <= 96)) || (((45 <= x && 45 <= y) && y <= 45) && x <= 45)) || (((11 <= x && x <= 11) && 11 <= y) && y <= 11)) || (((90 <= x && y <= 90) && 90 <= y) && x <= 90)) || (((x <= 19 && y <= 19) && 19 <= x) && 19 <= y)) || (((x <= 70 && y <= 70) && 70 <= x) && 70 <= y)) || (((23 <= x && 23 <= y) && y <= 23) && x <= 23) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 155.8s OverallTime, 102 OverallIterations, 101 TraceHistogramMax, 76.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 204 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 19537 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10403 GetRequests, 5148 SyntacticMatches, 2 SemanticMatches, 5253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 102 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1314 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 8 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 65.3s InterpolantComputationTime, 10605 NumberOfCodeBlocks, 10605 NumberOfCodeBlocksAsserted, 1494 NumberOfCheckSat, 10403 ConstructedInterpolants, 0 QuantifiedInterpolants, 2205739 SizeOfPredicates, 0 NumberOfNonLiveVariables, 21100 ConjunctsInSsa, 5351 ConjunctsInUnsatCore, 202 InterpolantComputations, 2 PerfectInterpolantSequences, 5151/348551 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_11-00-07-654.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/HiddenEquality-Safe.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_11-00-07-654.csv Received shutdown request...