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/DivisibilityInterpolantRequired01-BackwardSuccess.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-10-01 00:58:10,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-01 00:58:10,086 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-01 00:58:10,097 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-01 00:58:10,098 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-01 00:58:10,099 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-01 00:58:10,100 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-01 00:58:10,103 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-01 00:58:10,106 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-01 00:58:10,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-01 00:58:10,109 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-01 00:58:10,109 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-01 00:58:10,110 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-01 00:58:10,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-01 00:58:10,112 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-01 00:58:10,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-01 00:58:10,114 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-01 00:58:10,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-01 00:58:10,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-01 00:58:10,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-01 00:58:10,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-01 00:58:10,122 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-01 00:58:10,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-01 00:58:10,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-01 00:58:10,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-01 00:58:10,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-01 00:58:10,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-01 00:58:10,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-01 00:58:10,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-01 00:58:10,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-01 00:58:10,129 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-01 00:58:10,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-01 00:58:10,130 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-01 00:58:10,131 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-01 00:58:10,132 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-01 00:58:10,132 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-01 00:58:10,133 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-01 00:58:10,147 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-01 00:58:10,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-01 00:58:10,149 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-01 00:58:10,149 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-01 00:58:10,149 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-01 00:58:10,150 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-01 00:58:10,150 INFO L133 SettingsManager]: * Use SBE=true [2018-10-01 00:58:10,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-01 00:58:10,150 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-01 00:58:10,150 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-01 00:58:10,151 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-01 00:58:10,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-01 00:58:10,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-01 00:58:10,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-01 00:58:10,151 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-01 00:58:10,152 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-01 00:58:10,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-01 00:58:10,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-01 00:58:10,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-01 00:58:10,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-01 00:58:10,153 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-01 00:58:10,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-01 00:58:10,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:58:10,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-01 00:58:10,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-01 00:58:10,154 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-01 00:58:10,154 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-01 00:58:10,154 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-01 00:58:10,154 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-01 00:58:10,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-01 00:58:10,155 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-01 00:58:10,210 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-01 00:58:10,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-01 00:58:10,232 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-01 00:58:10,233 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-01 00:58:10,234 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-01 00:58:10,235 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-01 00:58:10,235 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/DivisibilityInterpolantRequired01-BackwardSuccess.bpl' [2018-10-01 00:58:10,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-01 00:58:10,280 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-01 00:58:10,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-01 00:58:10,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-01 00:58:10,281 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-01 00:58:10,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,320 WARN L165 Inliner]: Program contained no entry procedure! [2018-10-01 00:58:10,320 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-10-01 00:58:10,320 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-10-01 00:58:10,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-01 00:58:10,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-01 00:58:10,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-01 00:58:10,324 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-01 00:58:10,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... [2018-10-01 00:58:10,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-01 00:58:10,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-01 00:58:10,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-01 00:58:10,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-01 00:58:10,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-01 00:58:10,439 INFO L130 BoogieDeclarations]: Found specification of procedure proc [2018-10-01 00:58:10,439 INFO L138 BoogieDeclarations]: Found implementation of procedure proc [2018-10-01 00:58:10,605 INFO L345 CfgBuilder]: Using library mode [2018-10-01 00:58:10,606 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:58:10 BoogieIcfgContainer [2018-10-01 00:58:10,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-01 00:58:10,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-01 00:58:10,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-01 00:58:10,611 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-01 00:58:10,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 01.10 12:58:10" (1/2) ... [2018-10-01 00:58:10,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5df11ab4 and model type DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 12:58:10, skipping insertion in model container [2018-10-01 00:58:10,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 12:58:10" (2/2) ... [2018-10-01 00:58:10,615 INFO L112 eAbstractionObserver]: Analyzing ICFG DivisibilityInterpolantRequired01-BackwardSuccess.bpl [2018-10-01 00:58:10,625 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-01 00:58:10,633 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-01 00:58:10,686 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-01 00:58:10,687 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-01 00:58:10,688 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-01 00:58:10,688 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-01 00:58:10,688 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-01 00:58:10,688 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-01 00:58:10,688 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-01 00:58:10,689 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-01 00:58:10,689 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-01 00:58:10,705 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-10-01 00:58:10,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-10-01 00:58:10,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:10,712 INFO L375 BasicCegarLoop]: trace histogram [1, 1] [2018-10-01 00:58:10,714 INFO L423 AbstractCegarLoop]: === Iteration 1 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:10,721 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:10,722 INFO L82 PathProgramCache]: Analyzing trace with hash 967, now seen corresponding path program 1 times [2018-10-01 00:58:10,724 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:10,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:10,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:10,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:10,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:10,911 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-01 00:58:10,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-10-01 00:58:10,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-01 00:58:10,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-01 00:58:10,927 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:10,929 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-10-01 00:58:11,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:11,268 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-01 00:58:11,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-01 00:58:11,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-10-01 00:58:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:11,284 INFO L225 Difference]: With dead ends: 9 [2018-10-01 00:58:11,284 INFO L226 Difference]: Without dead ends: 4 [2018-10-01 00:58:11,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:58:11,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4 states. [2018-10-01 00:58:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4 to 4. [2018-10-01 00:58:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-10-01 00:58:11,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 4 transitions. [2018-10-01 00:58:11,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states and 4 transitions. Word has length 2 [2018-10-01 00:58:11,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:11,326 INFO L480 AbstractCegarLoop]: Abstraction has 4 states and 4 transitions. [2018-10-01 00:58:11,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-01 00:58:11,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4 states and 4 transitions. [2018-10-01 00:58:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-10-01 00:58:11,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:11,327 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-10-01 00:58:11,328 INFO L423 AbstractCegarLoop]: === Iteration 2 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:11,328 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:11,328 INFO L82 PathProgramCache]: Analyzing trace with hash 29921, now seen corresponding path program 1 times [2018-10-01 00:58:11,328 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:11,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:11,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:11,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:11,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:11,447 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:11,447 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:11,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:11,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:11,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:11,579 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:11,579 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-10-01 00:58:11,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-01 00:58:11,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-01 00:58:11,584 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:11,584 INFO L87 Difference]: Start difference. First operand 4 states and 4 transitions. Second operand 4 states. [2018-10-01 00:58:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:11,685 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2018-10-01 00:58:11,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-01 00:58:11,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2018-10-01 00:58:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:11,688 INFO L225 Difference]: With dead ends: 6 [2018-10-01 00:58:11,688 INFO L226 Difference]: Without dead ends: 5 [2018-10-01 00:58:11,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-10-01 00:58:11,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-10-01 00:58:11,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-10-01 00:58:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-10-01 00:58:11,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-10-01 00:58:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:11,694 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-10-01 00:58:11,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-01 00:58:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-10-01 00:58:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-10-01 00:58:11,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:11,695 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1] [2018-10-01 00:58:11,696 INFO L423 AbstractCegarLoop]: === Iteration 3 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:11,696 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:11,696 INFO L82 PathProgramCache]: Analyzing trace with hash 927495, now seen corresponding path program 2 times [2018-10-01 00:58:11,696 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:11,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:11,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:11,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:11,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:11,771 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:11,772 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:11,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:11,794 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:11,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:11,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:11,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:11,844 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:11,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-10-01 00:58:11,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-01 00:58:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-01 00:58:11,845 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:11,845 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-10-01 00:58:12,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:12,235 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2018-10-01 00:58:12,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-01 00:58:12,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-10-01 00:58:12,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:12,236 INFO L225 Difference]: With dead ends: 7 [2018-10-01 00:58:12,236 INFO L226 Difference]: Without dead ends: 6 [2018-10-01 00:58:12,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-10-01 00:58:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-10-01 00:58:12,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-10-01 00:58:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-10-01 00:58:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-10-01 00:58:12,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-10-01 00:58:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:12,241 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-10-01 00:58:12,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-01 00:58:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-10-01 00:58:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-10-01 00:58:12,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:12,242 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1] [2018-10-01 00:58:12,242 INFO L423 AbstractCegarLoop]: === Iteration 4 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:12,242 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:12,243 INFO L82 PathProgramCache]: Analyzing trace with hash 28752289, now seen corresponding path program 3 times [2018-10-01 00:58:12,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:12,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:12,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:12,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:12,363 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:12,363 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:12,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:12,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-01 00:58:12,387 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:12,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:12,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:12,439 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:12,439 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-01 00:58:12,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-01 00:58:12,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-01 00:58:12,440 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:12,440 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-10-01 00:58:12,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:12,714 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-10-01 00:58:12,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-01 00:58:12,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-10-01 00:58:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:12,715 INFO L225 Difference]: With dead ends: 8 [2018-10-01 00:58:12,716 INFO L226 Difference]: Without dead ends: 7 [2018-10-01 00:58:12,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-10-01 00:58:12,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-10-01 00:58:12,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-10-01 00:58:12,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-10-01 00:58:12,721 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-10-01 00:58:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:12,721 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-10-01 00:58:12,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-01 00:58:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-10-01 00:58:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-10-01 00:58:12,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:12,722 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1] [2018-10-01 00:58:12,722 INFO L423 AbstractCegarLoop]: === Iteration 5 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:12,722 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:12,722 INFO L82 PathProgramCache]: Analyzing trace with hash 891320903, now seen corresponding path program 4 times [2018-10-01 00:58:12,723 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:12,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:12,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:12,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:12,806 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:12,806 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:12,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:12,820 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:12,820 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:12,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:12,904 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:12,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-10-01 00:58:12,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-01 00:58:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-01 00:58:12,907 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:12,907 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-10-01 00:58:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:13,552 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-10-01 00:58:13,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-01 00:58:13,553 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-10-01 00:58:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:13,554 INFO L225 Difference]: With dead ends: 9 [2018-10-01 00:58:13,554 INFO L226 Difference]: Without dead ends: 8 [2018-10-01 00:58:13,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-10-01 00:58:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-10-01 00:58:13,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-10-01 00:58:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-10-01 00:58:13,558 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-10-01 00:58:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:13,559 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-10-01 00:58:13,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-01 00:58:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-10-01 00:58:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-10-01 00:58:13,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:13,560 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1] [2018-10-01 00:58:13,560 INFO L423 AbstractCegarLoop]: === Iteration 6 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:13,560 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:13,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144161, now seen corresponding path program 5 times [2018-10-01 00:58:13,561 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:13,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:13,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:13,704 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:13,704 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:13,704 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:13,713 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:13,733 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-10-01 00:58:13,734 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:13,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:13,773 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:13,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:13,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-10-01 00:58:13,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-01 00:58:13,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-01 00:58:13,795 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:13,796 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-10-01 00:58:14,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:14,034 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-10-01 00:58:14,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-01 00:58:14,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-10-01 00:58:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:14,035 INFO L225 Difference]: With dead ends: 10 [2018-10-01 00:58:14,035 INFO L226 Difference]: Without dead ends: 9 [2018-10-01 00:58:14,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-10-01 00:58:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-10-01 00:58:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-10-01 00:58:14,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-10-01 00:58:14,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-10-01 00:58:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:14,039 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-10-01 00:58:14,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-01 00:58:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-10-01 00:58:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-10-01 00:58:14,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:14,040 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1] [2018-10-01 00:58:14,040 INFO L423 AbstractCegarLoop]: === Iteration 7 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:14,040 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894087, now seen corresponding path program 6 times [2018-10-01 00:58:14,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:14,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:14,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:14,162 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:14,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:14,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:14,175 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:14,186 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-10-01 00:58:14,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:14,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:14,276 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:14,276 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-10-01 00:58:14,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-01 00:58:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-01 00:58:14,277 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:14,277 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-10-01 00:58:14,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:14,579 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-10-01 00:58:14,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-01 00:58:14,580 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-10-01 00:58:14,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:14,580 INFO L225 Difference]: With dead ends: 11 [2018-10-01 00:58:14,581 INFO L226 Difference]: Without dead ends: 10 [2018-10-01 00:58:14,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:14,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-10-01 00:58:14,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-10-01 00:58:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-10-01 00:58:14,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-10-01 00:58:14,584 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-10-01 00:58:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:14,585 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-10-01 00:58:14,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-01 00:58:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-10-01 00:58:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-10-01 00:58:14,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:14,585 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1] [2018-10-01 00:58:14,586 INFO L423 AbstractCegarLoop]: === Iteration 8 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:14,586 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141793, now seen corresponding path program 7 times [2018-10-01 00:58:14,586 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:14,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:14,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:14,752 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:14,752 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:14,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:14,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:14,819 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:14,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-10-01 00:58:14,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-01 00:58:14,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-01 00:58:14,820 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:14,820 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-10-01 00:58:15,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:15,271 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-10-01 00:58:15,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-01 00:58:15,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-10-01 00:58:15,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:15,272 INFO L225 Difference]: With dead ends: 12 [2018-10-01 00:58:15,272 INFO L226 Difference]: Without dead ends: 11 [2018-10-01 00:58:15,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-10-01 00:58:15,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-10-01 00:58:15,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-10-01 00:58:15,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-10-01 00:58:15,277 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-10-01 00:58:15,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:15,277 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-10-01 00:58:15,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-01 00:58:15,278 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-10-01 00:58:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-01 00:58:15,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:15,278 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1] [2018-10-01 00:58:15,278 INFO L423 AbstractCegarLoop]: === Iteration 9 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:15,278 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820679, now seen corresponding path program 8 times [2018-10-01 00:58:15,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:15,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:15,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:15,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:15,425 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:15,425 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:15,425 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:15,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:15,438 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:15,438 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:15,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:15,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:15,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:15,504 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-01 00:58:15,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-01 00:58:15,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-01 00:58:15,505 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:15,505 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-10-01 00:58:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:16,168 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-10-01 00:58:16,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-01 00:58:16,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-10-01 00:58:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:16,170 INFO L225 Difference]: With dead ends: 13 [2018-10-01 00:58:16,170 INFO L226 Difference]: Without dead ends: 12 [2018-10-01 00:58:16,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:16,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-10-01 00:58:16,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-10-01 00:58:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-10-01 00:58:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-10-01 00:58:16,174 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-10-01 00:58:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:16,175 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-10-01 00:58:16,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-01 00:58:16,175 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-10-01 00:58:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-01 00:58:16,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:16,175 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1] [2018-10-01 00:58:16,175 INFO L423 AbstractCegarLoop]: === Iteration 10 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:16,176 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:16,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166559, now seen corresponding path program 9 times [2018-10-01 00:58:16,176 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:16,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:16,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:16,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:16,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:16,311 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:16,311 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:16,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:16,387 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-01 00:58:16,388 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:16,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:16,438 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:16,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:16,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-10-01 00:58:16,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-01 00:58:16,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-01 00:58:16,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:16,460 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-10-01 00:58:17,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:17,041 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-01 00:58:17,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-01 00:58:17,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-10-01 00:58:17,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:17,043 INFO L225 Difference]: With dead ends: 14 [2018-10-01 00:58:17,043 INFO L226 Difference]: Without dead ends: 13 [2018-10-01 00:58:17,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:17,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-10-01 00:58:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-10-01 00:58:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-01 00:58:17,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-01 00:58:17,047 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-10-01 00:58:17,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:17,047 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-01 00:58:17,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-01 00:58:17,048 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-01 00:58:17,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-01 00:58:17,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:17,048 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1] [2018-10-01 00:58:17,048 INFO L423 AbstractCegarLoop]: === Iteration 11 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:17,049 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:17,049 INFO L82 PathProgramCache]: Analyzing trace with hash -562523129, now seen corresponding path program 10 times [2018-10-01 00:58:17,049 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:17,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:17,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:17,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:17,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:17,244 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:17,244 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:17,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:17,267 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:17,267 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:17,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:17,351 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:17,351 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-10-01 00:58:17,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-01 00:58:17,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-01 00:58:17,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:17,352 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-10-01 00:58:17,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:17,910 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-10-01 00:58:17,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-01 00:58:17,911 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-10-01 00:58:17,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:17,912 INFO L225 Difference]: With dead ends: 15 [2018-10-01 00:58:17,912 INFO L226 Difference]: Without dead ends: 14 [2018-10-01 00:58:17,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:58:17,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-01 00:58:17,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-10-01 00:58:17,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-10-01 00:58:17,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-10-01 00:58:17,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-10-01 00:58:17,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:17,917 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-10-01 00:58:17,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-01 00:58:17,917 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-10-01 00:58:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-01 00:58:17,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:17,918 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1] [2018-10-01 00:58:17,918 INFO L423 AbstractCegarLoop]: === Iteration 12 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:17,919 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash -258347871, now seen corresponding path program 11 times [2018-10-01 00:58:17,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:17,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:17,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:17,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:18,100 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:18,100 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:18,101 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:18,115 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:18,123 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-10-01 00:58:18,123 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:18,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:18,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:18,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-10-01 00:58:18,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-01 00:58:18,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-01 00:58:18,176 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:18,176 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-10-01 00:58:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:18,776 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-01 00:58:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-01 00:58:18,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-10-01 00:58:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:18,777 INFO L225 Difference]: With dead ends: 16 [2018-10-01 00:58:18,778 INFO L226 Difference]: Without dead ends: 15 [2018-10-01 00:58:18,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time [2018-10-01 00:58:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-10-01 00:58:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-10-01 00:58:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-01 00:58:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-01 00:58:18,782 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-10-01 00:58:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:18,782 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-01 00:58:18,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-01 00:58:18,783 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-01 00:58:18,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-01 00:58:18,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:18,783 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1] [2018-10-01 00:58:18,783 INFO L423 AbstractCegarLoop]: === Iteration 13 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:18,784 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:18,784 INFO L82 PathProgramCache]: Analyzing trace with hash 581150535, now seen corresponding path program 12 times [2018-10-01 00:58:18,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:18,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:18,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:18,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:19,120 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:19,120 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:19,129 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:19,145 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-10-01 00:58:19,146 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:19,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:19,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:19,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-10-01 00:58:19,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-01 00:58:19,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-01 00:58:19,209 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:19,209 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-10-01 00:58:20,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:20,056 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-01 00:58:20,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-01 00:58:20,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-10-01 00:58:20,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:20,057 INFO L225 Difference]: With dead ends: 17 [2018-10-01 00:58:20,057 INFO L226 Difference]: Without dead ends: 16 [2018-10-01 00:58:20,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-01 00:58:20,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-10-01 00:58:20,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-01 00:58:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-01 00:58:20,061 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-10-01 00:58:20,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:20,061 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-01 00:58:20,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-01 00:58:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-01 00:58:20,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-01 00:58:20,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:20,062 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1] [2018-10-01 00:58:20,062 INFO L423 AbstractCegarLoop]: === Iteration 14 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:20,063 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:20,063 INFO L82 PathProgramCache]: Analyzing trace with hash 835797345, now seen corresponding path program 13 times [2018-10-01 00:58:20,063 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:20,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:20,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:20,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:20,334 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:20,334 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:20,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:20,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:20,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:20,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-10-01 00:58:20,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-01 00:58:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-01 00:58:20,422 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:20,422 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-10-01 00:58:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:21,305 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-01 00:58:21,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-01 00:58:21,306 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-10-01 00:58:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:21,306 INFO L225 Difference]: With dead ends: 18 [2018-10-01 00:58:21,307 INFO L226 Difference]: Without dead ends: 17 [2018-10-01 00:58:21,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time [2018-10-01 00:58:21,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-01 00:58:21,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-10-01 00:58:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-01 00:58:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-01 00:58:21,311 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-10-01 00:58:21,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:21,312 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-01 00:58:21,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-01 00:58:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-01 00:58:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-01 00:58:21,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:21,313 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1] [2018-10-01 00:58:21,313 INFO L423 AbstractCegarLoop]: === Iteration 15 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:21,313 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:21,313 INFO L82 PathProgramCache]: Analyzing trace with hash 139913863, now seen corresponding path program 14 times [2018-10-01 00:58:21,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:21,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:21,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:21,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:21,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:21,543 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:21,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:21,544 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:21,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:21,583 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:21,584 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:21,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:21,710 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:21,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:21,732 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-10-01 00:58:21,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-01 00:58:21,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-01 00:58:21,732 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:21,732 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-10-01 00:58:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:22,616 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-01 00:58:22,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-01 00:58:22,617 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-10-01 00:58:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:22,617 INFO L225 Difference]: With dead ends: 19 [2018-10-01 00:58:22,618 INFO L226 Difference]: Without dead ends: 18 [2018-10-01 00:58:22,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:22,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-01 00:58:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-10-01 00:58:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-10-01 00:58:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-10-01 00:58:22,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-10-01 00:58:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:22,623 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-10-01 00:58:22,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-01 00:58:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-10-01 00:58:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-01 00:58:22,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:22,624 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1] [2018-10-01 00:58:22,624 INFO L423 AbstractCegarLoop]: === Iteration 16 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:22,624 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:22,624 INFO L82 PathProgramCache]: Analyzing trace with hash 42362401, now seen corresponding path program 15 times [2018-10-01 00:58:22,624 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:22,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:22,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:22,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:23,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:23,159 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:23,167 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:23,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-10-01 00:58:23,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:23,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:23,281 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:23,302 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:23,302 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-10-01 00:58:23,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-01 00:58:23,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-01 00:58:23,303 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:23,303 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-10-01 00:58:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:24,262 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-01 00:58:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-01 00:58:24,262 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-10-01 00:58:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:24,263 INFO L225 Difference]: With dead ends: 20 [2018-10-01 00:58:24,264 INFO L226 Difference]: Without dead ends: 19 [2018-10-01 00:58:24,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:24,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-01 00:58:24,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-10-01 00:58:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-01 00:58:24,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-01 00:58:24,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-10-01 00:58:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:24,269 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-01 00:58:24,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-01 00:58:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-01 00:58:24,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-01 00:58:24,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:24,269 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1] [2018-10-01 00:58:24,270 INFO L423 AbstractCegarLoop]: === Iteration 17 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:24,270 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:24,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234375, now seen corresponding path program 16 times [2018-10-01 00:58:24,270 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:24,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:24,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:24,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:24,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:24,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:24,611 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:24,624 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:24,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:24,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:24,665 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:24,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:24,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-10-01 00:58:24,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-01 00:58:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-01 00:58:24,686 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:24,686 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-10-01 00:58:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:25,831 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-01 00:58:25,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-01 00:58:25,832 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-10-01 00:58:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:25,833 INFO L225 Difference]: With dead ends: 21 [2018-10-01 00:58:25,833 INFO L226 Difference]: Without dead ends: 20 [2018-10-01 00:58:25,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-01 00:58:25,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-10-01 00:58:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-01 00:58:25,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-01 00:58:25,839 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-10-01 00:58:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:25,839 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-01 00:58:25,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-01 00:58:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-01 00:58:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-01 00:58:25,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:25,840 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1] [2018-10-01 00:58:25,840 INFO L423 AbstractCegarLoop]: === Iteration 18 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:25,840 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:25,840 INFO L82 PathProgramCache]: Analyzing trace with hash 2055559905, now seen corresponding path program 17 times [2018-10-01 00:58:25,841 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:25,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:25,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:25,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:26,644 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:26,645 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:26,645 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:26,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:26,662 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-10-01 00:58:26,662 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:26,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:26,938 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:26,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:26,960 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-10-01 00:58:26,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-01 00:58:26,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-01 00:58:26,960 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:26,960 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-10-01 00:58:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:28,093 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-01 00:58:28,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-01 00:58:28,093 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-10-01 00:58:28,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:28,094 INFO L225 Difference]: With dead ends: 22 [2018-10-01 00:58:28,094 INFO L226 Difference]: Without dead ends: 21 [2018-10-01 00:58:28,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:58:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-01 00:58:28,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-01 00:58:28,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-01 00:58:28,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-01 00:58:28,099 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-10-01 00:58:28,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:28,100 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-01 00:58:28,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-01 00:58:28,100 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-01 00:58:28,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-01 00:58:28,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:28,101 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1] [2018-10-01 00:58:28,101 INFO L423 AbstractCegarLoop]: === Iteration 19 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:28,101 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:28,101 INFO L82 PathProgramCache]: Analyzing trace with hash -702152441, now seen corresponding path program 18 times [2018-10-01 00:58:28,101 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:28,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:28,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:28,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:28,413 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:28,413 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:28,413 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:28,421 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:28,440 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-10-01 00:58:28,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:28,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:28,494 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:28,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:28,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-10-01 00:58:28,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-01 00:58:28,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-01 00:58:28,517 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:28,517 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-10-01 00:58:29,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:29,836 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-01 00:58:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-01 00:58:29,837 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-10-01 00:58:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:29,838 INFO L225 Difference]: With dead ends: 23 [2018-10-01 00:58:29,838 INFO L226 Difference]: Without dead ends: 22 [2018-10-01 00:58:29,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time [2018-10-01 00:58:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-01 00:58:29,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-10-01 00:58:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-01 00:58:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-10-01 00:58:29,843 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-10-01 00:58:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:29,844 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-10-01 00:58:29,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-01 00:58:29,844 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-10-01 00:58:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-01 00:58:29,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:29,845 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1] [2018-10-01 00:58:29,845 INFO L423 AbstractCegarLoop]: === Iteration 20 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:29,845 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash -291889247, now seen corresponding path program 19 times [2018-10-01 00:58:29,845 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:29,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:29,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:30,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:30,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:30,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:30,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:30,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:30,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-10-01 00:58:30,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-01 00:58:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-01 00:58:30,427 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:30,427 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-10-01 00:58:31,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:31,898 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-01 00:58:31,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-01 00:58:31,899 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-10-01 00:58:31,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:31,900 INFO L225 Difference]: With dead ends: 24 [2018-10-01 00:58:31,900 INFO L226 Difference]: Without dead ends: 23 [2018-10-01 00:58:31,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:31,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-01 00:58:31,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-10-01 00:58:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-01 00:58:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-01 00:58:31,905 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-10-01 00:58:31,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:31,905 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-01 00:58:31,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-01 00:58:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-01 00:58:31,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-01 00:58:31,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:31,906 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1] [2018-10-01 00:58:31,907 INFO L423 AbstractCegarLoop]: === Iteration 21 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:31,907 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:31,907 INFO L82 PathProgramCache]: Analyzing trace with hash -458632121, now seen corresponding path program 20 times [2018-10-01 00:58:31,907 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:31,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:31,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:31,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:31,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:32,458 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:32,458 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:32,458 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:32,466 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:32,475 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:32,475 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:32,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:32,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:32,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-10-01 00:58:32,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-01 00:58:32,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-01 00:58:32,542 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:32,542 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-10-01 00:58:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:34,071 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-01 00:58:34,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-01 00:58:34,071 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-10-01 00:58:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:34,072 INFO L225 Difference]: With dead ends: 25 [2018-10-01 00:58:34,073 INFO L226 Difference]: Without dead ends: 24 [2018-10-01 00:58:34,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:34,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-01 00:58:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-10-01 00:58:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-01 00:58:34,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-10-01 00:58:34,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-10-01 00:58:34,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:34,078 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-10-01 00:58:34,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-01 00:58:34,078 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-10-01 00:58:34,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-01 00:58:34,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:34,079 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1] [2018-10-01 00:58:34,079 INFO L423 AbstractCegarLoop]: === Iteration 22 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:34,079 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:34,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693919, now seen corresponding path program 21 times [2018-10-01 00:58:34,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:34,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:34,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:34,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:34,643 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:34,643 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:34,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:34,669 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-10-01 00:58:34,669 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:34,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:34,726 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:34,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:34,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-10-01 00:58:34,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-01 00:58:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-01 00:58:34,749 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:34,749 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-10-01 00:58:36,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:36,533 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-01 00:58:36,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-01 00:58:36,536 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-10-01 00:58:36,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:36,537 INFO L225 Difference]: With dead ends: 26 [2018-10-01 00:58:36,537 INFO L226 Difference]: Without dead ends: 25 [2018-10-01 00:58:36,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-01 00:58:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-01 00:58:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-01 00:58:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-01 00:58:36,542 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-10-01 00:58:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:36,542 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-01 00:58:36,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-01 00:58:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-01 00:58:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-01 00:58:36,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:36,543 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1] [2018-10-01 00:58:36,543 INFO L423 AbstractCegarLoop]: === Iteration 23 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:36,544 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:36,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161415, now seen corresponding path program 22 times [2018-10-01 00:58:36,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:36,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:36,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:36,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:36,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:37,132 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:37,132 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:37,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:37,148 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:37,148 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:37,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:37,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:37,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-10-01 00:58:37,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-01 00:58:37,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-01 00:58:37,224 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:37,224 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-10-01 00:58:38,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:38,937 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-10-01 00:58:38,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-01 00:58:38,938 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-10-01 00:58:38,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:38,939 INFO L225 Difference]: With dead ends: 27 [2018-10-01 00:58:38,939 INFO L226 Difference]: Without dead ends: 26 [2018-10-01 00:58:38,939 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:58:38,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-01 00:58:38,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-10-01 00:58:38,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-01 00:58:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-01 00:58:38,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-10-01 00:58:38,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:38,944 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-01 00:58:38,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-01 00:58:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-01 00:58:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-01 00:58:38,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:38,945 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1] [2018-10-01 00:58:38,945 INFO L423 AbstractCegarLoop]: === Iteration 24 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:38,945 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:38,946 INFO L82 PathProgramCache]: Analyzing trace with hash -818603743, now seen corresponding path program 23 times [2018-10-01 00:58:38,946 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:38,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:38,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:38,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:38,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:39,384 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:39,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:39,385 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:39,392 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:39,404 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-10-01 00:58:39,404 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:39,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:39,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:39,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-10-01 00:58:39,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-01 00:58:39,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-01 00:58:39,485 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:39,485 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-10-01 00:58:41,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:41,920 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-01 00:58:41,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-01 00:58:41,921 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-10-01 00:58:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:41,921 INFO L225 Difference]: With dead ends: 28 [2018-10-01 00:58:41,922 INFO L226 Difference]: Without dead ends: 27 [2018-10-01 00:58:41,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time [2018-10-01 00:58:41,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-10-01 00:58:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-10-01 00:58:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-01 00:58:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-01 00:58:41,926 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-10-01 00:58:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:41,926 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-01 00:58:41,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-01 00:58:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-01 00:58:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-01 00:58:41,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:41,927 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1] [2018-10-01 00:58:41,927 INFO L423 AbstractCegarLoop]: === Iteration 25 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:41,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:41,927 INFO L82 PathProgramCache]: Analyzing trace with hash 393087687, now seen corresponding path program 24 times [2018-10-01 00:58:41,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:41,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:41,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:42,459 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:42,459 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:42,467 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:58:42,479 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-10-01 00:58:42,480 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:42,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:42,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:42,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-10-01 00:58:42,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-01 00:58:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-01 00:58:42,594 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:42,594 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-10-01 00:58:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:44,730 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-01 00:58:44,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-01 00:58:44,730 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-10-01 00:58:44,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:44,731 INFO L225 Difference]: With dead ends: 29 [2018-10-01 00:58:44,731 INFO L226 Difference]: Without dead ends: 28 [2018-10-01 00:58:44,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-01 00:58:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-01 00:58:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-01 00:58:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-10-01 00:58:44,737 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-10-01 00:58:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:44,737 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-10-01 00:58:44,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-01 00:58:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-10-01 00:58:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-01 00:58:44,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:44,738 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1] [2018-10-01 00:58:44,739 INFO L423 AbstractCegarLoop]: === Iteration 26 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:44,739 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:44,739 INFO L82 PathProgramCache]: Analyzing trace with hash -699183647, now seen corresponding path program 25 times [2018-10-01 00:58:44,739 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:44,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:44,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:44,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:45,241 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:45,241 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:45,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:45,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:45,316 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:45,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:45,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-10-01 00:58:45,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-01 00:58:45,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-01 00:58:45,339 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:45,339 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-10-01 00:58:47,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:47,759 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-01 00:58:47,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-01 00:58:47,759 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-10-01 00:58:47,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:47,760 INFO L225 Difference]: With dead ends: 30 [2018-10-01 00:58:47,760 INFO L226 Difference]: Without dead ends: 29 [2018-10-01 00:58:47,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:47,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-01 00:58:47,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-01 00:58:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-01 00:58:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-01 00:58:47,766 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-10-01 00:58:47,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:47,766 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-01 00:58:47,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-01 00:58:47,766 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-01 00:58:47,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-01 00:58:47,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:47,767 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1] [2018-10-01 00:58:47,767 INFO L423 AbstractCegarLoop]: === Iteration 27 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:47,768 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:47,768 INFO L82 PathProgramCache]: Analyzing trace with hash -199856633, now seen corresponding path program 26 times [2018-10-01 00:58:47,768 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:47,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:47,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:58:47,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:48,303 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:48,304 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:48,304 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:48,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:58:48,321 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:58:48,321 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:48,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:48,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:48,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-10-01 00:58:48,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-01 00:58:48,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-01 00:58:48,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:48,403 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-10-01 00:58:50,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:50,860 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-10-01 00:58:50,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-01 00:58:50,860 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-10-01 00:58:50,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:50,861 INFO L225 Difference]: With dead ends: 31 [2018-10-01 00:58:50,861 INFO L226 Difference]: Without dead ends: 30 [2018-10-01 00:58:50,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time [2018-10-01 00:58:50,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-01 00:58:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-10-01 00:58:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-01 00:58:50,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-10-01 00:58:50,866 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-10-01 00:58:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:50,866 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-10-01 00:58:50,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-01 00:58:50,867 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-10-01 00:58:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-01 00:58:50,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:50,867 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1] [2018-10-01 00:58:50,867 INFO L423 AbstractCegarLoop]: === Iteration 28 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:50,868 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:50,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588383, now seen corresponding path program 27 times [2018-10-01 00:58:50,868 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:50,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:50,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:50,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:50,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:51,486 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:51,486 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:51,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:58:51,528 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-10-01 00:58:51,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:51,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:51,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:51,630 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-10-01 00:58:51,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-01 00:58:51,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-01 00:58:51,631 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:51,631 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-10-01 00:58:54,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:54,214 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-01 00:58:54,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-01 00:58:54,214 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-10-01 00:58:54,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:54,215 INFO L225 Difference]: With dead ends: 32 [2018-10-01 00:58:54,215 INFO L226 Difference]: Without dead ends: 31 [2018-10-01 00:58:54,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:58:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-01 00:58:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-10-01 00:58:54,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-01 00:58:54,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-01 00:58:54,220 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-10-01 00:58:54,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:54,220 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-01 00:58:54,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-01 00:58:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-01 00:58:54,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-01 00:58:54,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:54,221 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1] [2018-10-01 00:58:54,221 INFO L423 AbstractCegarLoop]: === Iteration 29 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:54,222 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:54,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302215, now seen corresponding path program 28 times [2018-10-01 00:58:54,222 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:54,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:54,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:54,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:54,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:54,785 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:54,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:54,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:54,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:58:54,806 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:58:54,806 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:54,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:54,932 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:54,932 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-10-01 00:58:54,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-01 00:58:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-01 00:58:54,932 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:54,932 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-10-01 00:58:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:58:57,781 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-01 00:58:57,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 00:58:57,782 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-10-01 00:58:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:58:57,782 INFO L225 Difference]: With dead ends: 33 [2018-10-01 00:58:57,783 INFO L226 Difference]: Without dead ends: 32 [2018-10-01 00:58:57,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:58:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-01 00:58:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-10-01 00:58:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-01 00:58:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-01 00:58:57,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-10-01 00:58:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:58:57,789 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-01 00:58:57,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-01 00:58:57,789 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-01 00:58:57,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-01 00:58:57,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:58:57,790 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1] [2018-10-01 00:58:57,790 INFO L423 AbstractCegarLoop]: === Iteration 30 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:58:57,790 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:58:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1104337055, now seen corresponding path program 29 times [2018-10-01 00:58:57,790 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:58:57,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:58:57,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:57,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:58:57,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:58:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:58:58,407 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:58,408 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:58:58,408 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:58:58,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:58:58,435 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-10-01 00:58:58,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:58:58,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:58:58,495 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:58:58,515 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:58:58,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-10-01 00:58:58,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-01 00:58:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-01 00:58:58,516 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:58:58,516 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-10-01 00:59:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:01,632 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-01 00:59:01,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-01 00:59:01,633 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-10-01 00:59:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:01,633 INFO L225 Difference]: With dead ends: 34 [2018-10-01 00:59:01,633 INFO L226 Difference]: Without dead ends: 33 [2018-10-01 00:59:01,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time [2018-10-01 00:59:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-01 00:59:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-01 00:59:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-01 00:59:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-01 00:59:01,638 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-10-01 00:59:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:01,639 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-01 00:59:01,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-01 00:59:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-01 00:59:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-01 00:59:01,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:01,640 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1] [2018-10-01 00:59:01,640 INFO L423 AbstractCegarLoop]: === Iteration 31 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:01,640 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:01,640 INFO L82 PathProgramCache]: Analyzing trace with hash 125289607, now seen corresponding path program 30 times [2018-10-01 00:59:01,640 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:01,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:01,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:01,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:02,385 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:02,385 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:59:02,412 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-10-01 00:59:02,412 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:02,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:02,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:02,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-10-01 00:59:02,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-01 00:59:02,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-01 00:59:02,549 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:02,549 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 33 states. [2018-10-01 00:59:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:05,630 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-01 00:59:05,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-01 00:59:05,630 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 32 [2018-10-01 00:59:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:05,631 INFO L225 Difference]: With dead ends: 35 [2018-10-01 00:59:05,631 INFO L226 Difference]: Without dead ends: 34 [2018-10-01 00:59:05,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:59:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-01 00:59:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-01 00:59:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-01 00:59:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-10-01 00:59:05,636 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-10-01 00:59:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:05,636 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-10-01 00:59:05,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-01 00:59:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-10-01 00:59:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-01 00:59:05,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:05,637 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1] [2018-10-01 00:59:05,637 INFO L423 AbstractCegarLoop]: === Iteration 32 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:05,637 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:05,637 INFO L82 PathProgramCache]: Analyzing trace with hash -410989535, now seen corresponding path program 31 times [2018-10-01 00:59:05,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:05,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:05,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:05,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:05,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:07,116 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:07,117 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:07,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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:07,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:07,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:07,233 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:07,254 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:07,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-10-01 00:59:07,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-01 00:59:07,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-01 00:59:07,254 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:07,255 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-10-01 00:59:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:10,559 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-01 00:59:10,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-01 00:59:10,559 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-10-01 00:59:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:10,560 INFO L225 Difference]: With dead ends: 36 [2018-10-01 00:59:10,560 INFO L226 Difference]: Without dead ends: 35 [2018-10-01 00:59:10,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 00:59:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-01 00:59:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-01 00:59:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-01 00:59:10,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-01 00:59:10,565 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-10-01 00:59:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:10,565 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-01 00:59:10,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-01 00:59:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-01 00:59:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-01 00:59:10,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:10,566 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1] [2018-10-01 00:59:10,566 INFO L423 AbstractCegarLoop]: === Iteration 33 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:10,566 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:10,566 INFO L82 PathProgramCache]: Analyzing trace with hash 144226247, now seen corresponding path program 32 times [2018-10-01 00:59:10,566 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:10,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:10,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:10,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:11,546 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:11,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:11,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:59:11,575 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:59:11,576 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:11,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:11,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:11,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-10-01 00:59:11,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-01 00:59:11,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-01 00:59:11,667 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:11,667 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 35 states. [2018-10-01 00:59:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:15,158 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-01 00:59:15,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-01 00:59:15,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 34 [2018-10-01 00:59:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:15,159 INFO L225 Difference]: With dead ends: 37 [2018-10-01 00:59:15,160 INFO L226 Difference]: Without dead ends: 36 [2018-10-01 00:59:15,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:59:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-01 00:59:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-10-01 00:59:15,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-01 00:59:15,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-01 00:59:15,164 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-10-01 00:59:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:15,165 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-01 00:59:15,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-01 00:59:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-01 00:59:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-01 00:59:15,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:15,165 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1] [2018-10-01 00:59:15,166 INFO L423 AbstractCegarLoop]: === Iteration 34 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:15,166 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:15,166 INFO L82 PathProgramCache]: Analyzing trace with hash 176046305, now seen corresponding path program 33 times [2018-10-01 00:59:15,166 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:15,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:15,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:15,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:15,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:15,903 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:15,903 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:15,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:59:15,927 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-10-01 00:59:15,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:15,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:16,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:16,129 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-10-01 00:59:16,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-01 00:59:16,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-01 00:59:16,129 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:16,129 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-10-01 00:59:19,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:19,890 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-01 00:59:19,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-01 00:59:19,890 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-10-01 00:59:19,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:19,891 INFO L225 Difference]: With dead ends: 38 [2018-10-01 00:59:19,891 INFO L226 Difference]: Without dead ends: 37 [2018-10-01 00:59:19,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time [2018-10-01 00:59:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-01 00:59:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-10-01 00:59:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-01 00:59:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-01 00:59:19,896 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-10-01 00:59:19,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:19,897 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-01 00:59:19,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-01 00:59:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-01 00:59:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-01 00:59:19,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:19,897 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1] [2018-10-01 00:59:19,898 INFO L423 AbstractCegarLoop]: === Iteration 35 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:19,898 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468103, now seen corresponding path program 34 times [2018-10-01 00:59:19,898 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:19,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:20,865 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:20,865 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:20,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:59:20,882 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:59:20,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:20,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:21,121 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:21,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:21,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-10-01 00:59:21,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-01 00:59:21,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-01 00:59:21,141 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:21,141 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 37 states. [2018-10-01 00:59:25,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:25,271 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-01 00:59:25,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-01 00:59:25,272 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 36 [2018-10-01 00:59:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:25,272 INFO L225 Difference]: With dead ends: 39 [2018-10-01 00:59:25,273 INFO L226 Difference]: Without dead ends: 38 [2018-10-01 00:59:25,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:59:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-01 00:59:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-10-01 00:59:25,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-01 00:59:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-01 00:59:25,276 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-10-01 00:59:25,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:25,277 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-01 00:59:25,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-01 00:59:25,277 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-01 00:59:25,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-01 00:59:25,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:25,277 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1] [2018-10-01 00:59:25,277 INFO L423 AbstractCegarLoop]: === Iteration 36 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:25,277 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:25,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772769, now seen corresponding path program 35 times [2018-10-01 00:59:25,278 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:25,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:25,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:25,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:25,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:26,146 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:26,146 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:26,153 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 00:59:26,175 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-10-01 00:59:26,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:26,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:26,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:26,290 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-10-01 00:59:26,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-01 00:59:26,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-01 00:59:26,290 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:26,290 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-10-01 00:59:30,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:30,603 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-01 00:59:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-01 00:59:30,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-10-01 00:59:30,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:30,605 INFO L225 Difference]: With dead ends: 40 [2018-10-01 00:59:30,605 INFO L226 Difference]: Without dead ends: 39 [2018-10-01 00:59:30,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time [2018-10-01 00:59:30,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-01 00:59:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-10-01 00:59:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-01 00:59:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-01 00:59:30,609 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-10-01 00:59:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:30,609 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-01 00:59:30,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-01 00:59:30,609 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-01 00:59:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-01 00:59:30,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:30,610 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1] [2018-10-01 00:59:30,610 INFO L423 AbstractCegarLoop]: === Iteration 37 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:30,610 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 440348231, now seen corresponding path program 36 times [2018-10-01 00:59:30,611 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:30,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:30,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:30,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:31,706 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:31,706 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:31,713 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 00:59:31,747 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-10-01 00:59:31,748 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:31,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:31,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:31,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-10-01 00:59:31,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-01 00:59:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-01 00:59:31,875 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:31,875 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 39 states. [2018-10-01 00:59:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:36,197 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-01 00:59:36,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-01 00:59:36,198 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 38 [2018-10-01 00:59:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:36,198 INFO L225 Difference]: With dead ends: 41 [2018-10-01 00:59:36,198 INFO L226 Difference]: Without dead ends: 40 [2018-10-01 00:59:36,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:59:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-01 00:59:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-10-01 00:59:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-01 00:59:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-01 00:59:36,202 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-10-01 00:59:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:36,202 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-01 00:59:36,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-01 00:59:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-01 00:59:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-01 00:59:36,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:36,203 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1] [2018-10-01 00:59:36,203 INFO L423 AbstractCegarLoop]: === Iteration 38 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:36,203 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash 765893217, now seen corresponding path program 37 times [2018-10-01 00:59:36,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:36,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:36,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:36,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:36,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:37,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:37,622 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:37,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:37,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:37,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:37,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-10-01 00:59:37,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-01 00:59:37,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-01 00:59:37,735 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:37,735 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-10-01 00:59:42,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:42,401 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-01 00:59:42,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-01 00:59:42,401 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-10-01 00:59:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:42,402 INFO L225 Difference]: With dead ends: 42 [2018-10-01 00:59:42,402 INFO L226 Difference]: Without dead ends: 41 [2018-10-01 00:59:42,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 00:59:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-01 00:59:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-10-01 00:59:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-01 00:59:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-01 00:59:42,406 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-10-01 00:59:42,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:42,406 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-01 00:59:42,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-01 00:59:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-01 00:59:42,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-01 00:59:42,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:42,406 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1] [2018-10-01 00:59:42,407 INFO L423 AbstractCegarLoop]: === Iteration 39 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:42,407 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2027114105, now seen corresponding path program 38 times [2018-10-01 00:59:42,407 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:42,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:42,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 00:59:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:43,374 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:43,374 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:43,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 00:59:43,405 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 00:59:43,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:43,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:43,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:43,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-10-01 00:59:43,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-01 00:59:43,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-01 00:59:43,504 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:43,504 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 41 states. [2018-10-01 00:59:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:48,453 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-01 00:59:48,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-01 00:59:48,454 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 40 [2018-10-01 00:59:48,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:48,454 INFO L225 Difference]: With dead ends: 43 [2018-10-01 00:59:48,454 INFO L226 Difference]: Without dead ends: 42 [2018-10-01 00:59:48,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s Time [2018-10-01 00:59:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-01 00:59:48,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-10-01 00:59:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-01 00:59:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-01 00:59:48,458 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-10-01 00:59:48,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:48,458 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-01 00:59:48,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-01 00:59:48,459 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-01 00:59:48,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-01 00:59:48,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:48,459 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1] [2018-10-01 00:59:48,459 INFO L423 AbstractCegarLoop]: === Iteration 40 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:48,459 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:48,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972129, now seen corresponding path program 39 times [2018-10-01 00:59:48,459 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:48,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:48,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:48,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:48,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:49,564 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:49,564 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:49,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 00:59:49,590 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-10-01 00:59:49,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:49,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:49,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:49,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-10-01 00:59:49,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-01 00:59:49,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-01 00:59:49,704 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:49,704 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-10-01 00:59:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 00:59:54,903 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-01 00:59:54,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-01 00:59:54,903 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-10-01 00:59:54,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 00:59:54,904 INFO L225 Difference]: With dead ends: 44 [2018-10-01 00:59:54,904 INFO L226 Difference]: Without dead ends: 43 [2018-10-01 00:59:54,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 00:59:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-01 00:59:54,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-10-01 00:59:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-01 00:59:54,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-01 00:59:54,908 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-10-01 00:59:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 00:59:54,909 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-01 00:59:54,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-01 00:59:54,909 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-01 00:59:54,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-01 00:59:54,909 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 00:59:54,909 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1] [2018-10-01 00:59:54,910 INFO L423 AbstractCegarLoop]: === Iteration 41 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 00:59:54,910 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 00:59:54,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495687, now seen corresponding path program 40 times [2018-10-01 00:59:54,910 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 00:59:54,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 00:59:54,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:54,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 00:59:54,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 00:59:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 00:59:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:56,051 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 00:59:56,051 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 00:59:56,060 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 00:59:56,071 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 00:59:56,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 00:59:56,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 00:59:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 00:59:56,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 00:59:56,198 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-10-01 00:59:56,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-01 00:59:56,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-01 00:59:56,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 00:59:56,198 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 43 states. [2018-10-01 01:00:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:01,611 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-01 01:00:01,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-01 01:00:01,612 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 42 [2018-10-01 01:00:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:01,612 INFO L225 Difference]: With dead ends: 45 [2018-10-01 01:00:01,612 INFO L226 Difference]: Without dead ends: 44 [2018-10-01 01:00:01,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time [2018-10-01 01:00:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-01 01:00:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-10-01 01:00:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-01 01:00:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-01 01:00:01,617 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-10-01 01:00:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:01,617 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-01 01:00:01,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-01 01:00:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-01 01:00:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-01 01:00:01,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:01,618 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1] [2018-10-01 01:00:01,618 INFO L423 AbstractCegarLoop]: === Iteration 42 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:01,618 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:01,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791393, now seen corresponding path program 41 times [2018-10-01 01:00:01,618 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:01,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:01,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:01,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:00:01,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:03,224 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:03,225 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:00:03,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:00:03,232 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:00:03,257 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-10-01 01:00:03,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:00:03,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:00:03,355 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:03,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:00:03,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-10-01 01:00:03,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-01 01:00:03,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-01 01:00:03,376 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:00:03,376 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-10-01 01:00:09,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:09,111 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-01 01:00:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-01 01:00:09,112 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-10-01 01:00:09,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:09,112 INFO L225 Difference]: With dead ends: 46 [2018-10-01 01:00:09,112 INFO L226 Difference]: Without dead ends: 45 [2018-10-01 01:00:09,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s Time [2018-10-01 01:00:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-01 01:00:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-10-01 01:00:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-01 01:00:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-01 01:00:09,116 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-10-01 01:00:09,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:09,116 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-01 01:00:09,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-01 01:00:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-01 01:00:09,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-01 01:00:09,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:09,116 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1] [2018-10-01 01:00:09,117 INFO L423 AbstractCegarLoop]: === Iteration 43 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:09,117 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:09,117 INFO L82 PathProgramCache]: Analyzing trace with hash -692041721, now seen corresponding path program 42 times [2018-10-01 01:00:09,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:09,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:09,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:09,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:00:09,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:10,464 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:00:10,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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:00:10,472 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:00:10,493 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-10-01 01:00:10,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:00:10,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:00:10,626 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:10,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:00:10,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-10-01 01:00:10,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-01 01:00:10,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-01 01:00:10,647 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:00:10,647 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 45 states. [2018-10-01 01:00:16,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:16,592 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-01 01:00:16,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-01 01:00:16,592 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-10-01 01:00:16,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:16,593 INFO L225 Difference]: With dead ends: 47 [2018-10-01 01:00:16,593 INFO L226 Difference]: Without dead ends: 46 [2018-10-01 01:00:16,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 01:00:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-01 01:00:16,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-10-01 01:00:16,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-01 01:00:16,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-01 01:00:16,597 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-10-01 01:00:16,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:16,598 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-01 01:00:16,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-01 01:00:16,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-01 01:00:16,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-01 01:00:16,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:16,598 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1] [2018-10-01 01:00:16,598 INFO L423 AbstractCegarLoop]: === Iteration 44 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:16,599 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:16,599 INFO L82 PathProgramCache]: Analyzing trace with hash 21543073, now seen corresponding path program 43 times [2018-10-01 01:00:16,599 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:16,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:16,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:16,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:00:16,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:17,898 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:00:17,898 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:00:17,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:00:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:17,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:00:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:18,045 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:00:18,045 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-10-01 01:00:18,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-01 01:00:18,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-01 01:00:18,045 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:00:18,046 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-10-01 01:00:24,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:24,278 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-01 01:00:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-01 01:00:24,279 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-10-01 01:00:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:24,279 INFO L225 Difference]: With dead ends: 48 [2018-10-01 01:00:24,279 INFO L226 Difference]: Without dead ends: 47 [2018-10-01 01:00:24,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time [2018-10-01 01:00:24,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-01 01:00:24,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-10-01 01:00:24,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-01 01:00:24,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-01 01:00:24,283 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-10-01 01:00:24,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:24,284 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-01 01:00:24,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-01 01:00:24,284 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-01 01:00:24,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-01 01:00:24,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:24,284 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1] [2018-10-01 01:00:24,285 INFO L423 AbstractCegarLoop]: === Iteration 45 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:24,285 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:24,285 INFO L82 PathProgramCache]: Analyzing trace with hash 667835207, now seen corresponding path program 44 times [2018-10-01 01:00:24,285 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:24,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:24,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:00:24,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:25,497 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:25,497 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:00:25,497 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:00:25,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:00:25,516 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:00:25,517 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:00:25,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:00:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:25,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:00:25,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-10-01 01:00:25,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-01 01:00:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-01 01:00:25,623 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:00:25,623 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 47 states. [2018-10-01 01:00:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:32,152 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-01 01:00:32,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-01 01:00:32,152 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 46 [2018-10-01 01:00:32,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:32,153 INFO L225 Difference]: With dead ends: 49 [2018-10-01 01:00:32,153 INFO L226 Difference]: Without dead ends: 48 [2018-10-01 01:00:32,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s Time [2018-10-01 01:00:32,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-01 01:00:32,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-10-01 01:00:32,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-01 01:00:32,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-01 01:00:32,157 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-10-01 01:00:32,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:32,158 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-01 01:00:32,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-01 01:00:32,158 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-01 01:00:32,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-01 01:00:32,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:32,158 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1] [2018-10-01 01:00:32,158 INFO L423 AbstractCegarLoop]: === Iteration 46 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:32,159 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:32,159 INFO L82 PathProgramCache]: Analyzing trace with hash -771945119, now seen corresponding path program 45 times [2018-10-01 01:00:32,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:32,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:32,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:32,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:00:32,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:33,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:33,637 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:00:33,637 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:00:33,648 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:00:33,670 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-10-01 01:00:33,670 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:00:33,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:00:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:33,799 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:00:33,799 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-10-01 01:00:33,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-01 01:00:33,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-01 01:00:33,800 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:00:33,800 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-10-01 01:00:40,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:40,551 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-01 01:00:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-01 01:00:40,552 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-10-01 01:00:40,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:40,553 INFO L225 Difference]: With dead ends: 50 [2018-10-01 01:00:40,553 INFO L226 Difference]: Without dead ends: 49 [2018-10-01 01:00:40,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 01:00:40,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-01 01:00:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-10-01 01:00:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-01 01:00:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-01 01:00:40,556 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-10-01 01:00:40,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:40,557 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-01 01:00:40,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-01 01:00:40,557 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-01 01:00:40,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-01 01:00:40,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:40,557 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1] [2018-10-01 01:00:40,558 INFO L423 AbstractCegarLoop]: === Iteration 47 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:40,558 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:40,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505031, now seen corresponding path program 46 times [2018-10-01 01:00:40,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:40,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:40,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:40,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:00:40,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:41,978 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:00:41,978 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:00:41,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:00:42,002 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:00:42,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:00:42,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:00:42,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:42,117 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:00:42,117 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-10-01 01:00:42,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-01 01:00:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-01 01:00:42,117 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:00:42,117 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 49 states. [2018-10-01 01:00:49,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:49,315 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-01 01:00:49,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-01 01:00:49,316 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 48 [2018-10-01 01:00:49,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:49,316 INFO L225 Difference]: With dead ends: 51 [2018-10-01 01:00:49,317 INFO L226 Difference]: Without dead ends: 50 [2018-10-01 01:00:49,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s Time [2018-10-01 01:00:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-01 01:00:49,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-01 01:00:49,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-01 01:00:49,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-01 01:00:49,321 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-10-01 01:00:49,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:49,322 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-01 01:00:49,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-01 01:00:49,322 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-01 01:00:49,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-01 01:00:49,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:49,322 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1] [2018-10-01 01:00:49,323 INFO L423 AbstractCegarLoop]: === Iteration 48 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:49,323 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081057, now seen corresponding path program 47 times [2018-10-01 01:00:49,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:49,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:49,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:49,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:00:49,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:49,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:00:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:50,759 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:00:50,759 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:00:50,766 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:00:50,787 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-10-01 01:00:50,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:00:50,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:00:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:00:50,950 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:00:50,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-10-01 01:00:50,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-01 01:00:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-01 01:00:50,951 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:00:50,951 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-10-01 01:00:58,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:00:58,359 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-01 01:00:58,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-01 01:00:58,360 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-10-01 01:00:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:00:58,360 INFO L225 Difference]: With dead ends: 52 [2018-10-01 01:00:58,361 INFO L226 Difference]: Without dead ends: 51 [2018-10-01 01:00:58,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 01:00:58,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-01 01:00:58,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-10-01 01:00:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-01 01:00:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-01 01:00:58,365 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-10-01 01:00:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:00:58,365 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-01 01:00:58,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-01 01:00:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-01 01:00:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-01 01:00:58,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:00:58,366 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1] [2018-10-01 01:00:58,366 INFO L423 AbstractCegarLoop]: === Iteration 49 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:00:58,366 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:00:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192953, now seen corresponding path program 48 times [2018-10-01 01:00:58,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:00:58,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:00:58,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:58,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:00:58,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:00:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:01:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:01,288 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:01:01,288 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:01:01,296 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:01:01,318 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-10-01 01:01:01,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:01:01,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:01:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:01,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:01:01,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-10-01 01:01:01,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-01 01:01:01,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-01 01:01:01,460 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:01:01,460 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 51 states. [2018-10-01 01:01:09,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:01:09,243 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-01 01:01:09,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-01 01:01:09,243 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 50 [2018-10-01 01:01:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:01:09,244 INFO L225 Difference]: With dead ends: 53 [2018-10-01 01:01:09,244 INFO L226 Difference]: Without dead ends: 52 [2018-10-01 01:01:09,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time [2018-10-01 01:01:09,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-01 01:01:09,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-10-01 01:01:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-01 01:01:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-01 01:01:09,249 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-10-01 01:01:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:01:09,249 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-01 01:01:09,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-01 01:01:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-01 01:01:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-01 01:01:09,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:01:09,250 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1] [2018-10-01 01:01:09,250 INFO L423 AbstractCegarLoop]: === Iteration 50 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:01:09,251 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:01:09,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593249, now seen corresponding path program 49 times [2018-10-01 01:01:09,251 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:01:09,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:01:09,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:09,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:01:09,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:01:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:10,786 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:01:10,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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:01:10,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:01:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:01:10,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:01:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:10,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:01:10,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-10-01 01:01:10,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-01 01:01:10,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-01 01:01:10,916 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:01:10,916 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-10-01 01:01:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:01:18,920 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-01 01:01:18,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-01 01:01:18,920 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-10-01 01:01:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:01:18,921 INFO L225 Difference]: With dead ends: 54 [2018-10-01 01:01:18,921 INFO L226 Difference]: Without dead ends: 53 [2018-10-01 01:01:18,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s Time [2018-10-01 01:01:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-01 01:01:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-10-01 01:01:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-01 01:01:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-01 01:01:18,925 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-10-01 01:01:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:01:18,926 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-01 01:01:18,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-01 01:01:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-01 01:01:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-01 01:01:18,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:01:18,926 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1] [2018-10-01 01:01:18,926 INFO L423 AbstractCegarLoop]: === Iteration 51 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:01:18,927 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:01:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1250315001, now seen corresponding path program 50 times [2018-10-01 01:01:18,927 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:01:18,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:01:18,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:18,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:01:18,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:01:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:20,724 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:01:20,724 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:01:20,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:01:20,748 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:01:20,749 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:01:20,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:01:20,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:20,872 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:01:20,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-10-01 01:01:20,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-01 01:01:20,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-01 01:01:20,873 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:01:20,873 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 53 states. [2018-10-01 01:01:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:01:29,151 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-01 01:01:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-01 01:01:29,152 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 52 [2018-10-01 01:01:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:01:29,153 INFO L225 Difference]: With dead ends: 55 [2018-10-01 01:01:29,153 INFO L226 Difference]: Without dead ends: 54 [2018-10-01 01:01:29,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 01:01:29,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-01 01:01:29,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-10-01 01:01:29,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-01 01:01:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-01 01:01:29,157 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-10-01 01:01:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:01:29,157 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-01 01:01:29,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-01 01:01:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-01 01:01:29,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-01 01:01:29,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:01:29,157 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1] [2018-10-01 01:01:29,158 INFO L423 AbstractCegarLoop]: === Iteration 52 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:01:29,158 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:01:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash -105059423, now seen corresponding path program 51 times [2018-10-01 01:01:29,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:01:29,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:01:29,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:29,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:01:29,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:01:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:30,967 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:01:30,967 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:01:30,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:01:31,002 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-10-01 01:01:31,002 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:01:31,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:01:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:31,134 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:01:31,134 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-10-01 01:01:31,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-01 01:01:31,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-01 01:01:31,134 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:01:31,134 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-10-01 01:01:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:01:39,847 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-01 01:01:39,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-01 01:01:39,847 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-10-01 01:01:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:01:39,847 INFO L225 Difference]: With dead ends: 56 [2018-10-01 01:01:39,847 INFO L226 Difference]: Without dead ends: 55 [2018-10-01 01:01:39,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 01:01:39,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-01 01:01:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-10-01 01:01:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-01 01:01:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-01 01:01:39,851 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-10-01 01:01:39,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:01:39,851 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-01 01:01:39,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-01 01:01:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-01 01:01:39,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-01 01:01:39,852 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:01:39,852 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1] [2018-10-01 01:01:39,852 INFO L423 AbstractCegarLoop]: === Iteration 53 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:01:39,853 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:01:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125127, now seen corresponding path program 52 times [2018-10-01 01:01:39,853 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:01:39,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:01:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:39,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:01:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:01:41,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:41,502 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:01:41,502 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:01:41,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:01:41,526 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:01:41,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:01:41,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:01:41,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:41,661 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:01:41,661 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-10-01 01:01:41,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-01 01:01:41,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-01 01:01:41,662 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:01:41,662 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 55 states. [2018-10-01 01:01:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:01:50,755 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-01 01:01:50,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-01 01:01:50,756 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 54 [2018-10-01 01:01:50,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:01:50,756 INFO L225 Difference]: With dead ends: 57 [2018-10-01 01:01:50,756 INFO L226 Difference]: Without dead ends: 56 [2018-10-01 01:01:50,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s Time [2018-10-01 01:01:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-01 01:01:50,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-10-01 01:01:50,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-01 01:01:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-01 01:01:50,761 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-10-01 01:01:50,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:01:50,761 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-01 01:01:50,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-01 01:01:50,761 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-01 01:01:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-01 01:01:50,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:01:50,762 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1] [2018-10-01 01:01:50,762 INFO L423 AbstractCegarLoop]: === Iteration 54 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:01:50,762 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:01:50,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107809, now seen corresponding path program 53 times [2018-10-01 01:01:50,762 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:01:50,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:01:50,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:50,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:01:50,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:01:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:01:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:52,585 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:01:52,585 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:01:52,593 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:01:52,624 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2018-10-01 01:01:52,625 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:01:52,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:01:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:01:52,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:01:52,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-10-01 01:01:52,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-01 01:01:52,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-01 01:01:52,759 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:01:52,759 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-10-01 01:02:02,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:02:02,213 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-01 01:02:02,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-01 01:02:02,214 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-10-01 01:02:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:02:02,214 INFO L225 Difference]: With dead ends: 58 [2018-10-01 01:02:02,214 INFO L226 Difference]: Without dead ends: 57 [2018-10-01 01:02:02,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 01:02:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-01 01:02:02,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-01 01:02:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-01 01:02:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-01 01:02:02,219 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-10-01 01:02:02,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:02:02,219 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-01 01:02:02,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-01 01:02:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-01 01:02:02,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-01 01:02:02,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:02:02,220 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1] [2018-10-01 01:02:02,220 INFO L423 AbstractCegarLoop]: === Iteration 55 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:02:02,220 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:02:02,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832583, now seen corresponding path program 54 times [2018-10-01 01:02:02,220 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:02:02,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:02:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:02,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:02:02,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:02:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:04,062 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:02:04,062 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:02:04,072 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:02:04,099 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2018-10-01 01:02:04,099 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:02:04,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:02:04,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:04,222 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:02:04,222 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-10-01 01:02:04,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-01 01:02:04,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-01 01:02:04,223 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:02:04,223 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 57 states. [2018-10-01 01:02:14,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:02:14,026 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-01 01:02:14,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-01 01:02:14,026 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-10-01 01:02:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:02:14,027 INFO L225 Difference]: With dead ends: 59 [2018-10-01 01:02:14,027 INFO L226 Difference]: Without dead ends: 58 [2018-10-01 01:02:14,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s Time [2018-10-01 01:02:14,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-01 01:02:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-10-01 01:02:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-01 01:02:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-01 01:02:14,031 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-10-01 01:02:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:02:14,031 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-01 01:02:14,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-01 01:02:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-01 01:02:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-01 01:02:14,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:02:14,032 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1] [2018-10-01 01:02:14,032 INFO L423 AbstractCegarLoop]: === Iteration 56 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:02:14,032 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:02:14,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895647, now seen corresponding path program 55 times [2018-10-01 01:02:14,032 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:02:14,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:02:14,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:14,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:02:14,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:02:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:16,082 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:02:16,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:02:16,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:02:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:02:16,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:02:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:16,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:02:16,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-10-01 01:02:16,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-01 01:02:16,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-01 01:02:16,229 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:02:16,229 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-10-01 01:02:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:02:26,324 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-01 01:02:26,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-01 01:02:26,325 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-10-01 01:02:26,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:02:26,326 INFO L225 Difference]: With dead ends: 60 [2018-10-01 01:02:26,326 INFO L226 Difference]: Without dead ends: 59 [2018-10-01 01:02:26,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s Time [2018-10-01 01:02:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-01 01:02:26,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-10-01 01:02:26,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-01 01:02:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-01 01:02:26,329 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-10-01 01:02:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:02:26,329 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-01 01:02:26,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-01 01:02:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-01 01:02:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-01 01:02:26,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:02:26,330 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1] [2018-10-01 01:02:26,330 INFO L423 AbstractCegarLoop]: === Iteration 57 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:02:26,330 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:02:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash -836059449, now seen corresponding path program 56 times [2018-10-01 01:02:26,330 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:02:26,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:02:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:26,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:02:26,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:02:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:28,185 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:02:28,185 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:02:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:02:28,209 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:02:28,209 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:02:28,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:02:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:28,364 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:02:28,364 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-10-01 01:02:28,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-01 01:02:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-01 01:02:28,364 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:02:28,364 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 59 states. [2018-10-01 01:02:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:02:38,772 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-01 01:02:38,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-01 01:02:38,773 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 58 [2018-10-01 01:02:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:02:38,773 INFO L225 Difference]: With dead ends: 61 [2018-10-01 01:02:38,773 INFO L226 Difference]: Without dead ends: 60 [2018-10-01 01:02:38,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s Time [2018-10-01 01:02:38,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-01 01:02:38,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-10-01 01:02:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-01 01:02:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-01 01:02:38,778 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-10-01 01:02:38,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:02:38,778 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-01 01:02:38,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-01 01:02:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-01 01:02:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-01 01:02:38,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:02:38,779 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1] [2018-10-01 01:02:38,779 INFO L423 AbstractCegarLoop]: === Iteration 58 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:02:38,779 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:02:38,779 INFO L82 PathProgramCache]: Analyzing trace with hash -148039199, now seen corresponding path program 57 times [2018-10-01 01:02:38,779 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:02:38,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:02:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:38,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:02:38,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:02:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:40,735 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:02:40,735 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:02:40,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:02:40,775 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-10-01 01:02:40,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:02:40,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:02:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:41,247 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:02:41,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-10-01 01:02:41,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-01 01:02:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-01 01:02:41,248 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:02:41,248 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-10-01 01:02:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:02:52,242 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-01 01:02:52,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-01 01:02:52,243 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-10-01 01:02:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:02:52,244 INFO L225 Difference]: With dead ends: 62 [2018-10-01 01:02:52,244 INFO L226 Difference]: Without dead ends: 61 [2018-10-01 01:02:52,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 01:02:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-01 01:02:52,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-10-01 01:02:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-01 01:02:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-01 01:02:52,249 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-10-01 01:02:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:02:52,249 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-01 01:02:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-01 01:02:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-01 01:02:52,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-01 01:02:52,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:02:52,250 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1] [2018-10-01 01:02:52,250 INFO L423 AbstractCegarLoop]: === Iteration 59 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:02:52,250 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:02:52,250 INFO L82 PathProgramCache]: Analyzing trace with hash -294247929, now seen corresponding path program 58 times [2018-10-01 01:02:52,250 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:02:52,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:02:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:52,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:02:52,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:02:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:02:54,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:54,703 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:02:54,703 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:02:54,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:02:54,728 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:02:54,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:02:54,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:02:54,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:02:54,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:02:54,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 59 [2018-10-01 01:02:54,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-01 01:02:54,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-01 01:02:54,861 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:02:54,861 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 61 states. [2018-10-01 01:03:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:03:05,976 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-01 01:03:05,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-01 01:03:05,977 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 60 [2018-10-01 01:03:05,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:03:05,977 INFO L225 Difference]: With dead ends: 63 [2018-10-01 01:03:05,978 INFO L226 Difference]: Without dead ends: 62 [2018-10-01 01:03:05,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 01:03:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-01 01:03:05,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-10-01 01:03:05,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-01 01:03:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-01 01:03:05,982 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-10-01 01:03:05,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:03:05,983 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-01 01:03:05,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-01 01:03:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-01 01:03:05,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-01 01:03:05,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:03:05,983 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1] [2018-10-01 01:03:05,983 INFO L423 AbstractCegarLoop]: === Iteration 60 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:03:05,984 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:03:05,984 INFO L82 PathProgramCache]: Analyzing trace with hash -531751263, now seen corresponding path program 59 times [2018-10-01 01:03:05,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:03:05,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:03:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:05,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:03:05,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:03:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:08,387 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:03:08,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:03:08,395 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:03:08,424 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2018-10-01 01:03:08,425 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:03:08,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:03:08,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:08,590 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:03:08,590 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 60 [2018-10-01 01:03:08,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-01 01:03:08,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-01 01:03:08,590 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:03:08,590 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-10-01 01:03:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:03:20,133 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-01 01:03:20,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-01 01:03:20,133 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-10-01 01:03:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:03:20,134 INFO L225 Difference]: With dead ends: 64 [2018-10-01 01:03:20,134 INFO L226 Difference]: Without dead ends: 63 [2018-10-01 01:03:20,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 01:03:20,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-01 01:03:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-10-01 01:03:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-01 01:03:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-01 01:03:20,138 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-10-01 01:03:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:03:20,139 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-01 01:03:20,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-01 01:03:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-01 01:03:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-01 01:03:20,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:03:20,139 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1] [2018-10-01 01:03:20,139 INFO L423 AbstractCegarLoop]: === Iteration 61 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:03:20,139 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:03:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash 695579975, now seen corresponding path program 60 times [2018-10-01 01:03:20,140 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:03:20,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:03:20,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:20,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:03:20,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:03:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:22,653 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:03:22,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-01 01:03:22,661 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:03:22,694 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-10-01 01:03:22,694 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:03:22,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:03:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:22,829 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:03:22,829 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2018-10-01 01:03:22,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-01 01:03:22,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-01 01:03:22,830 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:03:22,830 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 63 states. [2018-10-01 01:03:34,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:03:34,720 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-01 01:03:34,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-01 01:03:34,721 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 62 [2018-10-01 01:03:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:03:34,721 INFO L225 Difference]: With dead ends: 65 [2018-10-01 01:03:34,721 INFO L226 Difference]: Without dead ends: 64 [2018-10-01 01:03:34,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s Time [2018-10-01 01:03:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-01 01:03:34,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-10-01 01:03:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-01 01:03:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-01 01:03:34,726 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-10-01 01:03:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:03:34,726 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-01 01:03:34,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-01 01:03:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-01 01:03:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-01 01:03:34,727 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:03:34,727 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1] [2018-10-01 01:03:34,727 INFO L423 AbstractCegarLoop]: === Iteration 62 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:03:34,727 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:03:34,727 INFO L82 PathProgramCache]: Analyzing trace with hash 88142689, now seen corresponding path program 61 times [2018-10-01 01:03:34,727 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:03:34,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:03:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:34,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:03:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:03:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:36,906 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:03:36,906 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-10-01 01:03:36,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:03:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:03:36,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:03:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:37,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:03:37,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2018-10-01 01:03:37,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-01 01:03:37,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-01 01:03:37,069 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:03:37,069 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-10-01 01:03:49,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:03:49,595 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-01 01:03:49,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-01 01:03:49,595 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-10-01 01:03:49,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:03:49,596 INFO L225 Difference]: With dead ends: 66 [2018-10-01 01:03:49,596 INFO L226 Difference]: Without dead ends: 65 [2018-10-01 01:03:49,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time [2018-10-01 01:03:49,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-01 01:03:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-10-01 01:03:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-01 01:03:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-01 01:03:49,601 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-10-01 01:03:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:03:49,601 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-01 01:03:49,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-01 01:03:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-01 01:03:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-01 01:03:49,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:03:49,602 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1] [2018-10-01 01:03:49,602 INFO L423 AbstractCegarLoop]: === Iteration 63 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:03:49,602 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:03:49,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543993, now seen corresponding path program 62 times [2018-10-01 01:03:49,603 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:03:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:03:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:49,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:03:49,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:03:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:03:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:51,918 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:03:51,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 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-10-01 01:03:51,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:03:51,946 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:03:51,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:03:51,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:03:52,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:03:52,091 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:03:52,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2018-10-01 01:03:52,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-01 01:03:52,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-01 01:03:52,092 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:03:52,092 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 65 states. [2018-10-01 01:04:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:04:05,051 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-01 01:04:05,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-01 01:04:05,051 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 64 [2018-10-01 01:04:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:04:05,052 INFO L225 Difference]: With dead ends: 67 [2018-10-01 01:04:05,052 INFO L226 Difference]: Without dead ends: 66 [2018-10-01 01:04:05,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s Time [2018-10-01 01:04:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-01 01:04:05,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-10-01 01:04:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-01 01:04:05,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-01 01:04:05,057 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-10-01 01:04:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:04:05,058 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-01 01:04:05,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-01 01:04:05,058 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-01 01:04:05,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-01 01:04:05,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:04:05,058 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1] [2018-10-01 01:04:05,059 INFO L423 AbstractCegarLoop]: === Iteration 64 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:04:05,059 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:04:05,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223583, now seen corresponding path program 63 times [2018-10-01 01:04:05,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:04:05,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:04:05,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:05,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:04:05,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:04:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:07,427 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:04:07,428 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-10-01 01:04:07,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:04:07,469 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-10-01 01:04:07,469 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:04:07,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:04:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:07,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:04:07,618 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 64 [2018-10-01 01:04:07,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-01 01:04:07,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-01 01:04:07,619 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:04:07,619 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-10-01 01:04:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:04:20,919 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-01 01:04:20,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-01 01:04:20,919 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-10-01 01:04:20,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:04:20,920 INFO L225 Difference]: With dead ends: 68 [2018-10-01 01:04:20,920 INFO L226 Difference]: Without dead ends: 67 [2018-10-01 01:04:20,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time [2018-10-01 01:04:20,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-01 01:04:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-10-01 01:04:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-01 01:04:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-01 01:04:20,925 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-10-01 01:04:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:04:20,925 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-01 01:04:20,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-01 01:04:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-01 01:04:20,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-01 01:04:20,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:04:20,926 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1] [2018-10-01 01:04:20,926 INFO L423 AbstractCegarLoop]: === Iteration 65 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:04:20,926 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:04:20,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774535, now seen corresponding path program 64 times [2018-10-01 01:04:20,926 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:04:20,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:04:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:20,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:04:20,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:04:23,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:23,376 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:04:23,376 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-10-01 01:04:23,388 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:04:23,404 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:04:23,405 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:04:23,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:04:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:23,681 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:04:23,681 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 65 [2018-10-01 01:04:23,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-01 01:04:23,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-01 01:04:23,682 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:04:23,682 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 67 states. [2018-10-01 01:04:37,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:04:37,302 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-01 01:04:37,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-01 01:04:37,302 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 66 [2018-10-01 01:04:37,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:04:37,303 INFO L225 Difference]: With dead ends: 69 [2018-10-01 01:04:37,303 INFO L226 Difference]: Without dead ends: 68 [2018-10-01 01:04:37,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 01:04:37,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-01 01:04:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-10-01 01:04:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-01 01:04:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-01 01:04:37,307 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-10-01 01:04:37,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:04:37,308 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-01 01:04:37,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-01 01:04:37,308 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-01 01:04:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-01 01:04:37,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:04:37,309 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1] [2018-10-01 01:04:37,309 INFO L423 AbstractCegarLoop]: === Iteration 66 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:04:37,309 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:04:37,309 INFO L82 PathProgramCache]: Analyzing trace with hash -892597023, now seen corresponding path program 65 times [2018-10-01 01:04:37,309 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:04:37,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:04:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:37,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:04:37,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:04:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:40,086 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:04:40,087 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-10-01 01:04:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:04:40,124 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2018-10-01 01:04:40,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:04:40,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:04:40,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:40,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:04:40,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 66 [2018-10-01 01:04:40,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-01 01:04:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-01 01:04:40,273 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:04:40,273 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-10-01 01:04:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:04:54,368 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-01 01:04:54,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-01 01:04:54,369 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-10-01 01:04:54,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:04:54,369 INFO L225 Difference]: With dead ends: 70 [2018-10-01 01:04:54,369 INFO L226 Difference]: Without dead ends: 69 [2018-10-01 01:04:54,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s Time [2018-10-01 01:04:54,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-01 01:04:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-10-01 01:04:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-01 01:04:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-01 01:04:54,373 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-10-01 01:04:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:04:54,373 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-01 01:04:54,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-01 01:04:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-01 01:04:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-01 01:04:54,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:04:54,374 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1] [2018-10-01 01:04:54,374 INFO L423 AbstractCegarLoop]: === Iteration 67 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:04:54,375 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:04:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703993, now seen corresponding path program 66 times [2018-10-01 01:04:54,375 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:04:54,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:04:54,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:54,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:04:54,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:04:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:04:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:56,956 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:04:56,956 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 01:04:56,963 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:04:57,000 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-10-01 01:04:57,001 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:04:57,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:04:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:04:57,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:04:57,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 67 [2018-10-01 01:04:57,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-01 01:04:57,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-01 01:04:57,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:04:57,152 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 69 states. [2018-10-01 01:05:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:05:11,612 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-01 01:05:11,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-01 01:05:11,613 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-10-01 01:05:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:05:11,614 INFO L225 Difference]: With dead ends: 71 [2018-10-01 01:05:11,614 INFO L226 Difference]: Without dead ends: 70 [2018-10-01 01:05:11,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 01:05:11,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-01 01:05:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-10-01 01:05:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-01 01:05:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-01 01:05:11,619 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-10-01 01:05:11,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:05:11,619 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-01 01:05:11,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-01 01:05:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-01 01:05:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-01 01:05:11,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:05:11,620 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1] [2018-10-01 01:05:11,620 INFO L423 AbstractCegarLoop]: === Iteration 68 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:05:11,620 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:05:11,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718305, now seen corresponding path program 67 times [2018-10-01 01:05:11,621 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:05:11,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:05:11,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:11,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:05:11,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:11,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:05:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:05:14,233 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:05:14,233 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-10-01 01:05:14,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:05:14,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:05:14,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:05:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:05:14,415 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:05:14,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 68 [2018-10-01 01:05:14,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-01 01:05:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-01 01:05:14,416 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:05:14,416 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-10-01 01:05:29,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:05:29,288 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-01 01:05:29,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-01 01:05:29,289 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-10-01 01:05:29,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:05:29,290 INFO L225 Difference]: With dead ends: 72 [2018-10-01 01:05:29,290 INFO L226 Difference]: Without dead ends: 71 [2018-10-01 01:05:29,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s Time [2018-10-01 01:05:29,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-01 01:05:29,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-10-01 01:05:29,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-01 01:05:29,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-01 01:05:29,294 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-10-01 01:05:29,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:05:29,294 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-01 01:05:29,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-01 01:05:29,294 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-01 01:05:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-01 01:05:29,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:05:29,295 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1] [2018-10-01 01:05:29,295 INFO L423 AbstractCegarLoop]: === Iteration 69 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:05:29,295 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:05:29,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438265, now seen corresponding path program 68 times [2018-10-01 01:05:29,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:05:29,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:05:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:29,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:05:29,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:05:32,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:05:32,271 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:05:32,271 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-10-01 01:05:32,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:05:32,300 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:05:32,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:05:32,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:05:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:05:32,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:05:32,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 69 [2018-10-01 01:05:32,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-01 01:05:32,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-01 01:05:32,462 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:05:32,462 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 71 states. [2018-10-01 01:05:47,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:05:47,731 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-01 01:05:47,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-01 01:05:47,731 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 70 [2018-10-01 01:05:47,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:05:47,732 INFO L225 Difference]: With dead ends: 73 [2018-10-01 01:05:47,732 INFO L226 Difference]: Without dead ends: 72 [2018-10-01 01:05:47,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time [2018-10-01 01:05:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-01 01:05:47,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-10-01 01:05:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-01 01:05:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-01 01:05:47,736 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-10-01 01:05:47,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:05:47,736 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-01 01:05:47,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-01 01:05:47,737 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-01 01:05:47,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-01 01:05:47,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:05:47,737 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1] [2018-10-01 01:05:47,737 INFO L423 AbstractCegarLoop]: === Iteration 70 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:05:47,737 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:05:47,737 INFO L82 PathProgramCache]: Analyzing trace with hash 976119393, now seen corresponding path program 69 times [2018-10-01 01:05:47,737 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:05:47,738 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:05:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:47,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:05:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:05:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:05:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:05:50,790 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:05:50,790 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-10-01 01:05:50,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:05:50,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-10-01 01:05:50,834 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:05:50,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:05:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:05:50,993 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:05:50,994 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 70 [2018-10-01 01:05:50,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-01 01:05:50,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-01 01:05:50,994 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:05:50,994 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-10-01 01:06:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:06:06,831 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-01 01:06:06,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-01 01:06:06,831 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-10-01 01:06:06,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:06:06,832 INFO L225 Difference]: With dead ends: 74 [2018-10-01 01:06:06,832 INFO L226 Difference]: Without dead ends: 73 [2018-10-01 01:06:06,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s Time [2018-10-01 01:06:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-01 01:06:06,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-10-01 01:06:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-01 01:06:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-01 01:06:06,837 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-10-01 01:06:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:06:06,838 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-01 01:06:06,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-01 01:06:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-01 01:06:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-01 01:06:06,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:06:06,838 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1] [2018-10-01 01:06:06,839 INFO L423 AbstractCegarLoop]: === Iteration 71 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:06:06,839 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:06:06,839 INFO L82 PathProgramCache]: Analyzing trace with hash 194930055, now seen corresponding path program 70 times [2018-10-01 01:06:06,839 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:06:06,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:06:06,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:06:06,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:06:06,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:06:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:06:09,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:06:09,670 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:06:09,670 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-10-01 01:06:09,677 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:06:09,702 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:06:09,702 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:06:09,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:06:09,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:06:09,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:06:09,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 71 [2018-10-01 01:06:09,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-01 01:06:09,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-01 01:06:09,874 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:06:09,875 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 73 states. [2018-10-01 01:06:27,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:06:27,132 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-01 01:06:27,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-01 01:06:27,132 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 72 [2018-10-01 01:06:27,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:06:27,133 INFO L225 Difference]: With dead ends: 75 [2018-10-01 01:06:27,133 INFO L226 Difference]: Without dead ends: 74 [2018-10-01 01:06:27,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time [2018-10-01 01:06:27,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-01 01:06:27,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-01 01:06:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-01 01:06:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-01 01:06:27,139 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-10-01 01:06:27,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:06:27,140 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-01 01:06:27,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-01 01:06:27,140 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-01 01:06:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-01 01:06:27,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:06:27,140 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1] [2018-10-01 01:06:27,141 INFO L423 AbstractCegarLoop]: === Iteration 72 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:06:27,141 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:06:27,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864353, now seen corresponding path program 71 times [2018-10-01 01:06:27,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:06:27,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:06:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:06:27,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:06:27,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:06:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:06:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:06:30,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:06:30,067 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-10-01 01:06:30,077 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:06:30,137 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2018-10-01 01:06:30,137 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:06:30,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:06:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:06:30,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:06:30,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 72 [2018-10-01 01:06:30,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-01 01:06:30,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-01 01:06:30,318 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:06:30,318 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-10-01 01:06:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:06:47,190 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-01 01:06:47,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-01 01:06:47,191 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-10-01 01:06:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:06:47,192 INFO L225 Difference]: With dead ends: 76 [2018-10-01 01:06:47,192 INFO L226 Difference]: Without dead ends: 75 [2018-10-01 01:06:47,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s Time [2018-10-01 01:06:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-01 01:06:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-10-01 01:06:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-01 01:06:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-01 01:06:47,197 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-10-01 01:06:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:06:47,197 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-01 01:06:47,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-01 01:06:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-01 01:06:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-01 01:06:47,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:06:47,198 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1] [2018-10-01 01:06:47,198 INFO L423 AbstractCegarLoop]: === Iteration 73 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:06:47,198 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:06:47,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779961, now seen corresponding path program 72 times [2018-10-01 01:06:47,199 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:06:47,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:06:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:06:47,199 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:06:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:06:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:06:50,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:06:50,270 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:06:50,270 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-10-01 01:06:50,277 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:06:50,683 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-10-01 01:06:50,683 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:06:50,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:06:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:06:51,420 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:06:51,420 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 73 [2018-10-01 01:06:51,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-01 01:06:51,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-01 01:06:51,421 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:06:51,421 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 75 states. [2018-10-01 01:07:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:07:08,660 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-01 01:07:08,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-01 01:07:08,660 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 74 [2018-10-01 01:07:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:07:08,661 INFO L225 Difference]: With dead ends: 77 [2018-10-01 01:07:08,661 INFO L226 Difference]: Without dead ends: 76 [2018-10-01 01:07:08,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time [2018-10-01 01:07:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-01 01:07:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-10-01 01:07:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-01 01:07:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-01 01:07:08,666 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-10-01 01:07:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:07:08,667 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-01 01:07:08,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-01 01:07:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-01 01:07:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-01 01:07:08,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:07:08,667 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1] [2018-10-01 01:07:08,668 INFO L423 AbstractCegarLoop]: === Iteration 74 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:07:08,668 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:07:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash 365428705, now seen corresponding path program 73 times [2018-10-01 01:07:08,668 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:07:08,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:07:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:07:08,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:07:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:07:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:07:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:07:12,508 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:07:12,508 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-10-01 01:07:12,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:07:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:07:12,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:07:12,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:07:12,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:07:12,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 74 [2018-10-01 01:07:12,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-01 01:07:12,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-01 01:07:12,851 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:07:12,851 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-10-01 01:07:30,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:07:30,381 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-01 01:07:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-01 01:07:30,381 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-10-01 01:07:30,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:07:30,382 INFO L225 Difference]: With dead ends: 78 [2018-10-01 01:07:30,382 INFO L226 Difference]: Without dead ends: 77 [2018-10-01 01:07:30,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s Time [2018-10-01 01:07:30,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-01 01:07:30,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-10-01 01:07:30,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-01 01:07:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-01 01:07:30,387 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-10-01 01:07:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:07:30,387 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-01 01:07:30,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-01 01:07:30,387 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-01 01:07:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-01 01:07:30,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:07:30,387 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1] [2018-10-01 01:07:30,388 INFO L423 AbstractCegarLoop]: === Iteration 75 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:07:30,388 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:07:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1556612089, now seen corresponding path program 74 times [2018-10-01 01:07:30,388 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:07:30,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:07:30,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:07:30,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:07:30,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:07:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:07:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:07:35,460 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:07:35,460 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-01 01:07:35,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:07:35,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:07:35,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:07:35,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:07:35,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:07:35,679 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:07:35,679 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 75 [2018-10-01 01:07:35,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-01 01:07:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-01 01:07:35,680 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:07:35,680 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 77 states. [2018-10-01 01:07:53,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:07:53,734 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-01 01:07:53,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-01 01:07:53,734 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 76 [2018-10-01 01:07:53,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:07:53,735 INFO L225 Difference]: With dead ends: 79 [2018-10-01 01:07:53,735 INFO L226 Difference]: Without dead ends: 78 [2018-10-01 01:07:53,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s Time [2018-10-01 01:07:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-01 01:07:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-10-01 01:07:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-01 01:07:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-01 01:07:53,741 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-10-01 01:07:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:07:53,741 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-01 01:07:53,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-01 01:07:53,741 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-01 01:07:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-01 01:07:53,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:07:53,742 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1] [2018-10-01 01:07:53,742 INFO L423 AbstractCegarLoop]: === Iteration 76 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:07:53,742 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:07:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334559, now seen corresponding path program 75 times [2018-10-01 01:07:53,742 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:07:53,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:07:53,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:07:53,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:07:53,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:07:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:07:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:07:57,304 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:07:57,304 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-10-01 01:07:57,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:07:57,353 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-10-01 01:07:57,353 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:07:57,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:07:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:07:57,530 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:07:57,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 76 [2018-10-01 01:07:57,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-01 01:07:57,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-01 01:07:57,531 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:07:57,531 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-10-01 01:08:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:08:16,114 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-01 01:08:16,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-01 01:08:16,114 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-10-01 01:08:16,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:08:16,115 INFO L225 Difference]: With dead ends: 80 [2018-10-01 01:08:16,115 INFO L226 Difference]: Without dead ends: 79 [2018-10-01 01:08:16,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s Time [2018-10-01 01:08:16,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-01 01:08:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-10-01 01:08:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-01 01:08:16,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-01 01:08:16,121 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-10-01 01:08:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:08:16,121 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-01 01:08:16,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-01 01:08:16,121 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-01 01:08:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-01 01:08:16,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:08:16,121 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1] [2018-10-01 01:08:16,122 INFO L423 AbstractCegarLoop]: === Iteration 77 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:08:16,122 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:08:16,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600313, now seen corresponding path program 76 times [2018-10-01 01:08:16,122 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:08:16,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:08:16,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:08:16,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:08:16,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:08:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:08:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:08:20,716 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:08:20,716 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-10-01 01:08:20,722 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:08:20,743 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:08:20,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:08:20,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:08:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:08:20,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:08:20,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 77 [2018-10-01 01:08:20,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-01 01:08:20,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-01 01:08:20,936 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:08:20,936 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 79 states. [2018-10-01 01:08:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:08:40,112 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-01 01:08:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-01 01:08:40,113 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 78 [2018-10-01 01:08:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:08:40,114 INFO L225 Difference]: With dead ends: 81 [2018-10-01 01:08:40,114 INFO L226 Difference]: Without dead ends: 80 [2018-10-01 01:08:40,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s Time [2018-10-01 01:08:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-01 01:08:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-01 01:08:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-01 01:08:40,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-01 01:08:40,118 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-10-01 01:08:40,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:08:40,118 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-01 01:08:40,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-01 01:08:40,118 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-01 01:08:40,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-01 01:08:40,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:08:40,119 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1] [2018-10-01 01:08:40,119 INFO L423 AbstractCegarLoop]: === Iteration 78 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:08:40,119 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:08:40,119 INFO L82 PathProgramCache]: Analyzing trace with hash -268904095, now seen corresponding path program 77 times [2018-10-01 01:08:40,119 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:08:40,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:08:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:08:40,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:08:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:08:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:08:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:08:43,718 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:08:43,718 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-10-01 01:08:43,725 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-10-01 01:08:43,765 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2018-10-01 01:08:43,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:08:43,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:08:44,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:08:44,059 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:08:44,059 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 78 [2018-10-01 01:08:44,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-01 01:08:44,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-01 01:08:44,060 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:08:44,060 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-10-01 01:09:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:09:03,768 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-01 01:09:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-01 01:09:03,768 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-10-01 01:09:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:09:03,769 INFO L225 Difference]: With dead ends: 82 [2018-10-01 01:09:03,769 INFO L226 Difference]: Without dead ends: 81 [2018-10-01 01:09:03,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s Time [2018-10-01 01:09:03,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-01 01:09:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-10-01 01:09:03,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-01 01:09:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-01 01:09:03,775 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-10-01 01:09:03,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:09:03,775 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-01 01:09:03,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-01 01:09:03,775 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-01 01:09:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-01 01:09:03,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:09:03,776 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1] [2018-10-01 01:09:03,776 INFO L423 AbstractCegarLoop]: === Iteration 79 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:09:03,776 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:09:03,776 INFO L82 PathProgramCache]: Analyzing trace with hash 253907591, now seen corresponding path program 78 times [2018-10-01 01:09:03,777 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:09:03,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:09:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:09:03,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:09:03,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:09:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:09:07,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:09:07,663 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:09:07,663 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-10-01 01:09:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-10-01 01:09:07,772 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2018-10-01 01:09:07,772 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:09:07,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:09:07,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:09:07,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:09:07,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 79 [2018-10-01 01:09:07,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-01 01:09:07,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-01 01:09:07,957 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:09:07,957 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 81 states. [2018-10-01 01:09:28,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:09:28,152 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-01 01:09:28,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-01 01:09:28,152 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-10-01 01:09:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:09:28,153 INFO L225 Difference]: With dead ends: 83 [2018-10-01 01:09:28,153 INFO L226 Difference]: Without dead ends: 82 [2018-10-01 01:09:28,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s Time [2018-10-01 01:09:28,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-01 01:09:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-10-01 01:09:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-01 01:09:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-01 01:09:28,157 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-10-01 01:09:28,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:09:28,158 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-01 01:09:28,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-01 01:09:28,158 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-01 01:09:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-01 01:09:28,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:09:28,158 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1] [2018-10-01 01:09:28,159 INFO L423 AbstractCegarLoop]: === Iteration 80 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:09:28,159 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:09:28,159 INFO L82 PathProgramCache]: Analyzing trace with hash -718799327, now seen corresponding path program 79 times [2018-10-01 01:09:28,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:09:28,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:09:28,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:09:28,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:09:28,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:09:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:09:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:09:33,533 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:09:33,533 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-10-01 01:09:33,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:09:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:09:33,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:09:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:09:33,768 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:09:33,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 80 [2018-10-01 01:09:33,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-01 01:09:33,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-01 01:09:33,769 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:09:33,769 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-10-01 01:09:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:09:54,507 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-01 01:09:54,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-01 01:09:54,508 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-10-01 01:09:54,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:09:54,509 INFO L225 Difference]: With dead ends: 84 [2018-10-01 01:09:54,509 INFO L226 Difference]: Without dead ends: 83 [2018-10-01 01:09:54,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s Time [2018-10-01 01:09:54,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-01 01:09:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-10-01 01:09:54,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-01 01:09:54,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-01 01:09:54,514 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-10-01 01:09:54,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:09:54,514 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-01 01:09:54,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-01 01:09:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-01 01:09:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-01 01:09:54,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:09:54,515 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1] [2018-10-01 01:09:54,515 INFO L423 AbstractCegarLoop]: === Iteration 81 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:09:54,516 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:09:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -807942713, now seen corresponding path program 80 times [2018-10-01 01:09:54,516 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:09:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:09:54,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:09:54,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-01 01:09:54,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:09:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:09:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:09:58,934 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:09:58,934 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-10-01 01:09:58,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-01 01:09:58,965 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-01 01:09:58,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:09:58,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:09:59,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:09:59,154 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:09:59,154 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 81 [2018-10-01 01:09:59,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-01 01:09:59,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-01 01:09:59,155 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:09:59,155 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 83 states. [2018-10-01 01:10:20,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:10:20,967 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-01 01:10:20,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-01 01:10:20,967 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 82 [2018-10-01 01:10:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:10:20,968 INFO L225 Difference]: With dead ends: 85 [2018-10-01 01:10:20,968 INFO L226 Difference]: Without dead ends: 84 [2018-10-01 01:10:20,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s Time [2018-10-01 01:10:20,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-01 01:10:20,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-10-01 01:10:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-01 01:10:20,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-01 01:10:20,972 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-10-01 01:10:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:10:20,973 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-01 01:10:20,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-01 01:10:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-01 01:10:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-01 01:10:20,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:10:20,973 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1] [2018-10-01 01:10:20,973 INFO L423 AbstractCegarLoop]: === Iteration 82 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:10:20,973 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:10:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash 723579617, now seen corresponding path program 81 times [2018-10-01 01:10:20,974 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:10:20,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:10:20,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:10:20,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:10:20,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:10:20,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:10:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:10:25,173 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:10:25,173 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-10-01 01:10:25,180 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-01 01:10:25,225 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-10-01 01:10:25,225 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:10:25,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:10:26,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:10:26,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:10:26,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 82 [2018-10-01 01:10:26,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-01 01:10:26,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-01 01:10:26,433 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:10:26,433 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-10-01 01:10:49,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-01 01:10:49,373 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-01 01:10:49,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-01 01:10:49,373 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-10-01 01:10:49,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-01 01:10:49,374 INFO L225 Difference]: With dead ends: 86 [2018-10-01 01:10:49,374 INFO L226 Difference]: Without dead ends: 85 [2018-10-01 01:10:49,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s Time [2018-10-01 01:10:49,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-01 01:10:49,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-01 01:10:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-01 01:10:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-01 01:10:49,378 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-10-01 01:10:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-01 01:10:49,379 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-01 01:10:49,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-01 01:10:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-01 01:10:49,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-01 01:10:49,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-01 01:10:49,379 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1] [2018-10-01 01:10:49,379 INFO L423 AbstractCegarLoop]: === Iteration 83 === [procErr0ASSERT_VIOLATIONASSERT]=== [2018-10-01 01:10:49,379 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-01 01:10:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash 956131591, now seen corresponding path program 82 times [2018-10-01 01:10:49,380 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-01 01:10:49,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-01 01:10:49,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:10:49,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-01 01:10:49,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-01 01:10:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-01 01:10:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:10:53,674 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-01 01:10:53,674 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-10-01 01:10:53,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-01 01:10:53,705 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-01 01:10:53,705 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-01 01:10:53,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-01 01:10:53,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-01 01:10:53,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-01 01:10:53,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 83 [2018-10-01 01:10:53,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-01 01:10:53,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-01 01:10:53,899 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-10-01 01:10:53,899 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 85 states. Received shutdown request... [2018-10-01 01:11:01,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-01 01:11:01,785 WARN L549 AbstractCegarLoop]: Verification canceled [2018-10-01 01:11:01,792 WARN L206 ceAbstractionStarter]: Timeout [2018-10-01 01:11:01,792 INFO L202 PluginConnector]: Adding new model DivisibilityInterpolantRequired01-BackwardSuccess.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.10 01:11:01 BoogieIcfgContainer [2018-10-01 01:11:01,792 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-01 01:11:01,793 INFO L168 Benchmark]: Toolchain (without parser) took 771514.74 ms. Allocated memory was 1.6 GB in the beginning and 1.0 GB in the end (delta: -512.8 MB). Free memory was 1.5 GB in the beginning and 888.8 MB in the end (delta: 590.5 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2018-10-01 01:11:01,794 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 01:11:01,795 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.81 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 01:11:01,795 INFO L168 Benchmark]: Boogie Preprocessor took 38.69 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-01 01:11:01,796 INFO L168 Benchmark]: RCFGBuilder took 243.74 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-01 01:11:01,796 INFO L168 Benchmark]: TraceAbstraction took 771184.66 ms. Allocated memory was 1.6 GB in the beginning and 1.0 GB in the end (delta: -512.8 MB). Free memory was 1.5 GB in the beginning and 888.8 MB in the end (delta: 569.4 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. [2018-10-01 01:11:01,799 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.22 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.81 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.69 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 243.74 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 771184.66 ms. Allocated memory was 1.6 GB in the beginning and 1.0 GB in the end (delta: -512.8 MB). Free memory was 1.5 GB in the beginning and 888.8 MB in the end (delta: 569.4 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 21). Cancelled while BasicCegarLoop was constructing difference of abstraction (85states) and FLOYD_HOARE automaton (currently 31 states, 85 states before enhancement), while ReachableStatesComputation was computing reachable states (29 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 771.1s OverallTime, 83 OverallIterations, 82 TraceHistogramMax, 621.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 166 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 196379 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 186.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6971 GetRequests, 3403 SyntacticMatches, 82 SemanticMatches, 3486 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 140.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=82, 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, 82 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 143.2s InterpolantComputationTime, 7136 NumberOfCodeBlocks, 7136 NumberOfCodeBlocksAsserted, 1026 NumberOfCheckSat, 6971 ConstructedInterpolants, 0 QuantifiedInterpolants, 2716749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7216 ConjunctsInSsa, 7052 ConjunctsInUnsatCore, 165 InterpolantComputations, 1 PerfectInterpolantSequences, 0/190568 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-01_01-11-01-810.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/DivisibilityInterpolantRequired01-BackwardSuccess.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-01_01-11-01-810.csv Completed graceful shutdown