java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:32:08,139 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:32:08,142 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:32:08,153 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:32:08,154 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:32:08,155 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:32:08,156 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:32:08,158 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:32:08,159 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:32:08,160 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:32:08,161 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:32:08,161 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:32:08,162 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:32:08,163 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:32:08,164 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:32:08,165 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:32:08,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:32:08,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:32:08,170 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:32:08,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:32:08,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:32:08,174 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:32:08,176 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:32:08,176 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:32:08,176 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:32:08,177 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:32:08,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:32:08,181 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:32:08,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:32:08,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:32:08,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:32:08,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:32:08,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:32:08,186 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:32:08,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:32:08,190 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:32:08,190 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-26 21:32:08,213 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:32:08,213 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:32:08,214 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:32:08,214 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:32:08,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:32:08,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:32:08,215 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:32:08,216 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:32:08,216 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:32:08,216 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:32:08,216 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:32:08,216 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:32:08,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:32:08,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:32:08,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:32:08,217 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:32:08,217 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:32:08,218 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:32:08,218 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:32:08,218 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:32:08,218 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:32:08,218 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:32:08,219 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:32:08,219 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:32:08,219 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:32:08,219 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:32:08,219 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:32:08,220 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:32:08,220 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:32:08,220 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:32:08,262 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:32:08,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:32:08,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:32:08,279 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:32:08,280 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:32:08,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl [2018-09-26 21:32:08,281 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified02.bpl' [2018-09-26 21:32:08,348 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:32:08,352 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:32:08,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:32:08,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:32:08,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:32:08,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,395 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 21:32:08,395 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 21:32:08,396 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 21:32:08,413 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:32:08,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:32:08,414 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:32:08,414 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:32:08,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,426 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... [2018-09-26 21:32:08,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:32:08,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:32:08,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:32:08,436 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:32:08,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:32:08,511 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 21:32:08,511 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 21:32:08,512 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-26 21:32:08,825 INFO L343 CfgBuilder]: Using library mode [2018-09-26 21:32:08,825 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:32:08 BoogieIcfgContainer [2018-09-26 21:32:08,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:32:08,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:32:08,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:32:08,831 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:32:08,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:32:08" (1/2) ... [2018-09-26 21:32:08,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78511c22 and model type PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:32:08, skipping insertion in model container [2018-09-26 21:32:08,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:32:08" (2/2) ... [2018-09-26 21:32:08,835 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified02.bpl [2018-09-26 21:32:08,862 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:32:08,877 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:32:08,945 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:32:08,946 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:32:08,946 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:32:08,946 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:32:08,946 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:32:08,946 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:32:08,947 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:32:08,947 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:32:08,947 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:32:08,969 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-26 21:32:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 21:32:08,978 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:08,979 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 21:32:08,980 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:08,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:08,986 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-26 21:32:08,988 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:08,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:09,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:09,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:09,181 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:32:09,181 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 21:32:09,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:32:09,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:32:09,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:32:09,198 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-26 21:32:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:09,251 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-26 21:32:09,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:32:09,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 21:32:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:09,264 INFO L225 Difference]: With dead ends: 17 [2018-09-26 21:32:09,265 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 21:32:09,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 21:32:09,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 21:32:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-26 21:32:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 21:32:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 21:32:09,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-26 21:32:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:09,299 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 21:32:09,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:32:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 21:32:09,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 21:32:09,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:09,300 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-26 21:32:09,301 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:09,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:09,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-26 21:32:09,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:09,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:09,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:09,513 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:09,513 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:09,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:09,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:09,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:09,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:09,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:09,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:09,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:09,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:09,766 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-26 21:32:09,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 21:32:09,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 21:32:09,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:32:09,768 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-26 21:32:09,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:09,872 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 21:32:09,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:32:09,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-26 21:32:09,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:09,873 INFO L225 Difference]: With dead ends: 15 [2018-09-26 21:32:09,873 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 21:32:09,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-26 21:32:09,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 21:32:09,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-26 21:32:09,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 21:32:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 21:32:09,879 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-26 21:32:09,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:09,879 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 21:32:09,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 21:32:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 21:32:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 21:32:09,880 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:09,880 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-26 21:32:09,881 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:09,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-26 21:32:09,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:09,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:09,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:10,006 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:10,007 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:10,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:10,066 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:10,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:10,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:10,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:10,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:10,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:10,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:10,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:10,444 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-26 21:32:10,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 21:32:10,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 21:32:10,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:32:10,445 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-26 21:32:10,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:10,524 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 21:32:10,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:32:10,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-26 21:32:10,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:10,527 INFO L225 Difference]: With dead ends: 19 [2018-09-26 21:32:10,527 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 21:32:10,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-26 21:32:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 21:32:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 21:32:10,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 21:32:10,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 21:32:10,533 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-26 21:32:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:10,534 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 21:32:10,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 21:32:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 21:32:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 21:32:10,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:10,535 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-26 21:32:10,535 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:10,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:10,536 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-26 21:32:10,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:10,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:10,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:10,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:10,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:10,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:10,699 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:10,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:10,783 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-26 21:32:10,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:10,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:10,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:10,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:10,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:10,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:10,928 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:10,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:10,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-26 21:32:10,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 21:32:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 21:32:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:32:10,954 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-26 21:32:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:11,047 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 21:32:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 21:32:11,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-26 21:32:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:11,049 INFO L225 Difference]: With dead ends: 23 [2018-09-26 21:32:11,049 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 21:32:11,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-26 21:32:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 21:32:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-26 21:32:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 21:32:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 21:32:11,055 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-26 21:32:11,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:11,056 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 21:32:11,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 21:32:11,056 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 21:32:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 21:32:11,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:11,057 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-26 21:32:11,058 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:11,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:11,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-26 21:32:11,059 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:11,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:11,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:11,207 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:11,207 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:11,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:11,242 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:11,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:11,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:11,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:11,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:11,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:11,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:11,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:11,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-26 21:32:11,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 21:32:11,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 21:32:11,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:32:11,458 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-26 21:32:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:11,533 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 21:32:11,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 21:32:11,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-26 21:32:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:11,535 INFO L225 Difference]: With dead ends: 27 [2018-09-26 21:32:11,535 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 21:32:11,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-26 21:32:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 21:32:11,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-26 21:32:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 21:32:11,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 21:32:11,541 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-26 21:32:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:11,542 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 21:32:11,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 21:32:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 21:32:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 21:32:11,543 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:11,543 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-26 21:32:11,544 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:11,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-26 21:32:11,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:11,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:11,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:11,822 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:11,823 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:11,833 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:11,918 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-26 21:32:11,918 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:11,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:11,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:11,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:12,255 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:12,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:12,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-26 21:32:12,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 21:32:12,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 21:32:12,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:32:12,278 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-26 21:32:12,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:12,369 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 21:32:12,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 21:32:12,373 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-26 21:32:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:12,374 INFO L225 Difference]: With dead ends: 31 [2018-09-26 21:32:12,374 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 21:32:12,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-26 21:32:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 21:32:12,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-26 21:32:12,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 21:32:12,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 21:32:12,379 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-26 21:32:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:12,380 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 21:32:12,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 21:32:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 21:32:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 21:32:12,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:12,381 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-26 21:32:12,381 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:12,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-26 21:32:12,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:12,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:12,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:12,545 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:12,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:12,553 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:12,573 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-26 21:32:12,574 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:12,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:12,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:12,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:12,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:12,814 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:12,815 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-26 21:32:12,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 21:32:12,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 21:32:12,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:32:12,816 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-26 21:32:12,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:12,907 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 21:32:12,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 21:32:12,908 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-26 21:32:12,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:12,910 INFO L225 Difference]: With dead ends: 35 [2018-09-26 21:32:12,910 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 21:32:12,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-26 21:32:12,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 21:32:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-26 21:32:12,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 21:32:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 21:32:12,916 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-26 21:32:12,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:12,916 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 21:32:12,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 21:32:12,917 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 21:32:12,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 21:32:12,918 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:12,918 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-26 21:32:12,918 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:12,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:12,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-26 21:32:12,918 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:12,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:12,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:13,055 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:13,055 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:13,055 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:13,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:13,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:13,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:13,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:13,297 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:13,297 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-26 21:32:13,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 21:32:13,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 21:32:13,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:32:13,298 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-26 21:32:13,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:13,426 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 21:32:13,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 21:32:13,427 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-26 21:32:13,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:13,428 INFO L225 Difference]: With dead ends: 39 [2018-09-26 21:32:13,429 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 21:32:13,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-26 21:32:13,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 21:32:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-26 21:32:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 21:32:13,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 21:32:13,435 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-26 21:32:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:13,435 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 21:32:13,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 21:32:13,435 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 21:32:13,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 21:32:13,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:13,437 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-26 21:32:13,437 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:13,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:13,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-26 21:32:13,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:13,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:13,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:13,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:13,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:13,675 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:13,675 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:13,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:13,703 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:13,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:13,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:13,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:13,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:13,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:13,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:13,957 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-26 21:32:13,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 21:32:13,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 21:32:13,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:32:13,958 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-26 21:32:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:14,231 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 21:32:14,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 21:32:14,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-26 21:32:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:14,232 INFO L225 Difference]: With dead ends: 43 [2018-09-26 21:32:14,232 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 21:32:14,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-26 21:32:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 21:32:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-26 21:32:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 21:32:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 21:32:14,238 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-26 21:32:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:14,238 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 21:32:14,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 21:32:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 21:32:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 21:32:14,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:14,240 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-26 21:32:14,240 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:14,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-26 21:32:14,240 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:14,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:14,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:14,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:14,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:14,823 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:14,824 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:14,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:14,885 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-26 21:32:14,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:14,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:14,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:14,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:14,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:14,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:15,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:15,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-26 21:32:15,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 21:32:15,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 21:32:15,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:32:15,217 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-26 21:32:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:15,329 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 21:32:15,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 21:32:15,329 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-26 21:32:15,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:15,331 INFO L225 Difference]: With dead ends: 47 [2018-09-26 21:32:15,331 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 21:32:15,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-26 21:32:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 21:32:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-26 21:32:15,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 21:32:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 21:32:15,337 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-26 21:32:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:15,338 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 21:32:15,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 21:32:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 21:32:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 21:32:15,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:15,339 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-26 21:32:15,340 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:15,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:15,340 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-26 21:32:15,340 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:15,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:15,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:15,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:15,578 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:15,578 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:15,578 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:15,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:15,620 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:15,620 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:15,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:15,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:15,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:15,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:15,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:15,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:15,935 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-26 21:32:15,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 21:32:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 21:32:15,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:32:15,936 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-26 21:32:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:16,064 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 21:32:16,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 21:32:16,069 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-26 21:32:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:16,069 INFO L225 Difference]: With dead ends: 51 [2018-09-26 21:32:16,070 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 21:32:16,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-26 21:32:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 21:32:16,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-26 21:32:16,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 21:32:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 21:32:16,075 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-26 21:32:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:16,075 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 21:32:16,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 21:32:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 21:32:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 21:32:16,076 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:16,076 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-26 21:32:16,076 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:16,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-26 21:32:16,077 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:16,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:16,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:16,768 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:16,768 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:16,768 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:16,782 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:16,845 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-26 21:32:16,846 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:16,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:16,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:16,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:16,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:16,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:17,249 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:17,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-26 21:32:17,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 21:32:17,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 21:32:17,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:32:17,251 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-26 21:32:17,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:17,356 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 21:32:17,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 21:32:17,356 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-26 21:32:17,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:17,357 INFO L225 Difference]: With dead ends: 55 [2018-09-26 21:32:17,358 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 21:32:17,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-26 21:32:17,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 21:32:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-26 21:32:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 21:32:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 21:32:17,364 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-26 21:32:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:17,365 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 21:32:17,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 21:32:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 21:32:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 21:32:17,366 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:17,366 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-26 21:32:17,366 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:17,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-26 21:32:17,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:17,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:17,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:17,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:17,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:17,827 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:17,827 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:17,834 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:17,864 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-26 21:32:17,865 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:17,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:17,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:17,887 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:17,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:17,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:18,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:18,270 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-26 21:32:18,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 21:32:18,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 21:32:18,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:32:18,272 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-26 21:32:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:18,421 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 21:32:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 21:32:18,422 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-26 21:32:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:18,423 INFO L225 Difference]: With dead ends: 59 [2018-09-26 21:32:18,423 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 21:32:18,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-26 21:32:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 21:32:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-26 21:32:18,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 21:32:18,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 21:32:18,431 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-26 21:32:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:18,431 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 21:32:18,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 21:32:18,431 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 21:32:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 21:32:18,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:18,432 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-26 21:32:18,432 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:18,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:18,433 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-26 21:32:18,433 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:18,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:18,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:18,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:18,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:18,733 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:18,733 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:18,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:18,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:18,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:18,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:18,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:18,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:19,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:19,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-26 21:32:19,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 21:32:19,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 21:32:19,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:32:19,187 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-26 21:32:19,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:19,447 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 21:32:19,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 21:32:19,447 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-26 21:32:19,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:19,448 INFO L225 Difference]: With dead ends: 63 [2018-09-26 21:32:19,448 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 21:32:19,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-26 21:32:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 21:32:19,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-26 21:32:19,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 21:32:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 21:32:19,454 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-26 21:32:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:19,455 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 21:32:19,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 21:32:19,455 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 21:32:19,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 21:32:19,456 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:19,456 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-26 21:32:19,456 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:19,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-26 21:32:19,457 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:19,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:19,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:19,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:19,812 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:19,812 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:19,847 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:19,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:19,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:19,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:19,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:19,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:19,865 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:20,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:20,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-26 21:32:20,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 21:32:20,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 21:32:20,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:32:20,187 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-26 21:32:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:20,315 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 21:32:20,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 21:32:20,316 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-26 21:32:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:20,317 INFO L225 Difference]: With dead ends: 67 [2018-09-26 21:32:20,317 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 21:32:20,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-26 21:32:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 21:32:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-26 21:32:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 21:32:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 21:32:20,324 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-26 21:32:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:20,325 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 21:32:20,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 21:32:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 21:32:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 21:32:20,326 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:20,326 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-26 21:32:20,326 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:20,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:20,327 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-26 21:32:20,327 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:20,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:20,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:20,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:20,740 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:20,741 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:20,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:20,797 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-26 21:32:20,797 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:20,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:20,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:20,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:20,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:20,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:21,123 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:21,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-26 21:32:21,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 21:32:21,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 21:32:21,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:32:21,145 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-26 21:32:21,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:21,391 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 21:32:21,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 21:32:21,391 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-26 21:32:21,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:21,392 INFO L225 Difference]: With dead ends: 71 [2018-09-26 21:32:21,392 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 21:32:21,393 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 21:32:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 21:32:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-26 21:32:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 21:32:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 21:32:21,398 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-26 21:32:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:21,399 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 21:32:21,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 21:32:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 21:32:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 21:32:21,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:21,401 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-26 21:32:21,401 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:21,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:21,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-26 21:32:21,401 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:21,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:21,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:21,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:21,688 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:21,688 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:21,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:21,719 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:21,719 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:21,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:21,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:21,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:21,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:21,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:22,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:22,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-26 21:32:22,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 21:32:22,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 21:32:22,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:32:22,149 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-26 21:32:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:22,264 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 21:32:22,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 21:32:22,265 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-26 21:32:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:22,266 INFO L225 Difference]: With dead ends: 75 [2018-09-26 21:32:22,266 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 21:32:22,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 21:32:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 21:32:22,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-26 21:32:22,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 21:32:22,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 21:32:22,272 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-26 21:32:22,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:22,273 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 21:32:22,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 21:32:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 21:32:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 21:32:22,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:22,274 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-26 21:32:22,274 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:22,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:22,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-26 21:32:22,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:22,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:22,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:22,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:22,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:22,652 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:22,652 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:22,660 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:22,697 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-26 21:32:22,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:22,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:22,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:22,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:22,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:23,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:23,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-26 21:32:23,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 21:32:23,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 21:32:23,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:32:23,079 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-26 21:32:23,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:23,184 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 21:32:23,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 21:32:23,185 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-26 21:32:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:23,186 INFO L225 Difference]: With dead ends: 79 [2018-09-26 21:32:23,186 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 21:32:23,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 21:32:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 21:32:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-26 21:32:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 21:32:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 21:32:23,192 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-26 21:32:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:23,192 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 21:32:23,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 21:32:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 21:32:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 21:32:23,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:23,194 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-26 21:32:23,194 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:23,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-26 21:32:23,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:23,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:23,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:23,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:23,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:23,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:23,485 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:23,486 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:23,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:23,493 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:23,539 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-26 21:32:23,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:23,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:23,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:23,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:23,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:23,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:24,161 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:24,181 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:24,182 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-26 21:32:24,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 21:32:24,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 21:32:24,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:32:24,183 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-26 21:32:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:24,305 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 21:32:24,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 21:32:24,306 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-26 21:32:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:24,307 INFO L225 Difference]: With dead ends: 83 [2018-09-26 21:32:24,307 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 21:32:24,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 21:32:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 21:32:24,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-26 21:32:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 21:32:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 21:32:24,311 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-26 21:32:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:24,312 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 21:32:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 21:32:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 21:32:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 21:32:24,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:24,313 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-26 21:32:24,313 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:24,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-26 21:32:24,313 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:24,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:24,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:24,663 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:24,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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:24,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:24,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:24,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:24,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:24,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:24,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:25,322 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:25,343 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:25,344 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-26 21:32:25,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 21:32:25,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 21:32:25,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:32:25,345 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-26 21:32:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:25,514 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 21:32:25,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 21:32:25,515 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-26 21:32:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:25,516 INFO L225 Difference]: With dead ends: 87 [2018-09-26 21:32:25,516 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 21:32:25,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 21:32:25,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 21:32:25,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-26 21:32:25,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 21:32:25,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 21:32:25,523 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-26 21:32:25,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:25,523 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 21:32:25,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 21:32:25,523 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 21:32:25,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 21:32:25,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:25,524 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-26 21:32:25,525 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:25,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-26 21:32:25,525 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:25,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:25,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:26,534 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:26,534 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:26,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:26,571 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:26,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:26,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:26,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:26,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:26,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:26,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:27,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:27,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-26 21:32:27,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 21:32:27,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 21:32:27,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:32:27,013 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-26 21:32:27,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:27,169 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 21:32:27,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 21:32:27,170 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-26 21:32:27,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:27,171 INFO L225 Difference]: With dead ends: 91 [2018-09-26 21:32:27,171 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 21:32:27,172 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 21:32:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 21:32:27,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-26 21:32:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 21:32:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 21:32:27,176 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-26 21:32:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:27,176 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 21:32:27,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 21:32:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 21:32:27,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 21:32:27,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:27,177 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-26 21:32:27,177 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:27,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:27,178 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-26 21:32:27,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:27,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:27,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:27,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:27,925 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:27,925 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:27,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:27,986 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-26 21:32:27,986 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:27,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:27,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:27,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:28,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:28,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:30,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:30,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-26 21:32:30,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 21:32:30,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 21:32:30,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:32:30,045 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-26 21:32:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:30,195 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 21:32:30,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 21:32:30,198 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-26 21:32:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:30,199 INFO L225 Difference]: With dead ends: 95 [2018-09-26 21:32:30,199 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 21:32:30,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 21:32:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 21:32:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-26 21:32:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 21:32:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 21:32:30,203 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-26 21:32:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:30,203 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 21:32:30,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 21:32:30,203 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 21:32:30,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 21:32:30,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:30,204 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-26 21:32:30,204 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:30,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:30,204 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-26 21:32:30,204 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:30,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:30,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:30,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:30,617 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:30,617 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:30,617 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:30,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:30,663 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:30,663 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:30,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:30,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:30,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:30,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:30,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:31,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:31,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-26 21:32:31,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 21:32:31,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 21:32:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:32:31,112 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-26 21:32:31,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:31,270 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 21:32:31,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 21:32:31,271 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-26 21:32:31,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:31,272 INFO L225 Difference]: With dead ends: 99 [2018-09-26 21:32:31,272 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 21:32:31,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 21:32:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 21:32:31,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-26 21:32:31,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 21:32:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 21:32:31,277 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-26 21:32:31,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:31,277 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 21:32:31,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 21:32:31,277 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 21:32:31,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 21:32:31,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:31,278 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-26 21:32:31,278 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:31,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:31,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-26 21:32:31,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:31,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:31,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:31,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:31,703 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:31,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:31,710 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:31,767 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-26 21:32:31,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:31,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:31,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:31,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:31,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:31,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:32,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:32,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-26 21:32:32,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 21:32:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 21:32:32,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:32:32,472 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-26 21:32:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:32,726 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 21:32:32,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 21:32:32,726 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-26 21:32:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:32,728 INFO L225 Difference]: With dead ends: 103 [2018-09-26 21:32:32,728 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 21:32:32,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 21:32:32,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 21:32:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-26 21:32:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 21:32:32,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 21:32:32,733 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-26 21:32:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:32,734 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 21:32:32,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 21:32:32,734 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 21:32:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 21:32:32,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:32,735 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-26 21:32:32,735 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:32,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:32,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-26 21:32:32,736 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:32,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:32,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:32,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:33,176 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:33,176 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:33,183 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:33,246 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-26 21:32:33,246 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:33,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:33,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:33,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:33,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:33,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:33,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:33,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-26 21:32:33,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 21:32:33,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 21:32:33,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:32:33,755 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-26 21:32:33,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:33,969 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 21:32:33,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 21:32:33,969 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-26 21:32:33,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:33,970 INFO L225 Difference]: With dead ends: 107 [2018-09-26 21:32:33,970 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 21:32:33,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 21:32:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 21:32:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-26 21:32:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 21:32:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 21:32:33,974 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-26 21:32:33,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:33,975 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 21:32:33,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 21:32:33,975 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 21:32:33,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 21:32:33,975 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:33,976 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-26 21:32:33,976 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:33,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:33,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-26 21:32:33,976 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:33,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:33,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:34,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:34,881 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:34,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:34,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:34,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:34,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:34,927 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:34,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:34,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:35,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:35,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-26 21:32:35,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 21:32:35,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 21:32:35,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 21:32:35,664 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-26 21:32:35,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:35,908 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 21:32:35,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 21:32:35,909 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-26 21:32:35,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:35,910 INFO L225 Difference]: With dead ends: 111 [2018-09-26 21:32:35,910 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 21:32:35,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 21:32:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 21:32:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-26 21:32:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 21:32:35,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 21:32:35,915 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-26 21:32:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:35,915 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 21:32:35,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 21:32:35,916 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 21:32:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 21:32:35,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:35,916 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-26 21:32:35,916 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:35,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:35,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-26 21:32:35,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:35,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:35,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:36,427 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:36,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:36,470 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:36,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:36,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:36,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:36,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:36,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:36,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:37,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:37,131 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:37,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-26 21:32:37,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 21:32:37,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 21:32:37,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:32:37,133 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-26 21:32:37,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:37,333 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 21:32:37,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 21:32:37,334 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-26 21:32:37,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:37,335 INFO L225 Difference]: With dead ends: 115 [2018-09-26 21:32:37,335 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 21:32:37,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 21:32:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 21:32:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-26 21:32:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 21:32:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 21:32:37,341 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-26 21:32:37,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:37,341 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 21:32:37,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 21:32:37,342 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 21:32:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 21:32:37,342 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:37,342 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-26 21:32:37,343 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:37,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:37,343 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-26 21:32:37,343 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:37,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:37,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:37,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:37,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:37,861 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:37,861 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:37,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:37,953 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-26 21:32:37,953 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:37,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:37,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:37,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:38,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:38,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:38,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:38,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-26 21:32:38,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 21:32:38,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 21:32:38,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:32:38,565 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-26 21:32:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:38,773 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 21:32:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 21:32:38,773 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-26 21:32:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:38,774 INFO L225 Difference]: With dead ends: 119 [2018-09-26 21:32:38,775 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 21:32:38,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 21:32:38,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 21:32:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-26 21:32:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 21:32:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 21:32:38,780 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-26 21:32:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:38,780 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 21:32:38,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 21:32:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 21:32:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 21:32:38,780 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:38,781 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-26 21:32:38,781 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:38,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-26 21:32:38,781 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:38,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:38,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:38,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:39,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:39,690 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:39,690 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:39,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:39,737 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:39,738 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:39,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:39,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:39,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:39,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:39,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:40,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:40,406 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:40,407 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-26 21:32:40,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 21:32:40,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 21:32:40,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 21:32:40,408 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-26 21:32:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:40,615 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 21:32:40,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 21:32:40,617 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-26 21:32:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:40,618 INFO L225 Difference]: With dead ends: 123 [2018-09-26 21:32:40,619 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 21:32:40,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 21:32:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 21:32:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-26 21:32:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 21:32:40,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 21:32:40,624 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-26 21:32:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:40,624 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 21:32:40,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 21:32:40,625 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 21:32:40,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 21:32:40,625 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:40,625 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-26 21:32:40,625 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:40,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:40,626 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-26 21:32:40,626 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:40,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:40,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:40,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:41,362 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:41,362 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:41,370 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:41,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-26 21:32:41,448 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:41,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:41,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:41,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:41,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:41,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:42,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:42,275 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-26 21:32:42,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 21:32:42,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 21:32:42,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:32:42,276 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-26 21:32:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:42,516 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 21:32:42,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 21:32:42,516 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-26 21:32:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:42,518 INFO L225 Difference]: With dead ends: 127 [2018-09-26 21:32:42,518 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 21:32:42,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 21:32:42,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 21:32:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-26 21:32:42,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 21:32:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 21:32:42,523 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-26 21:32:42,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:42,523 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 21:32:42,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 21:32:42,523 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 21:32:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 21:32:42,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:42,524 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-26 21:32:42,524 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:42,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:42,524 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-26 21:32:42,524 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:42,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:42,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:42,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:43,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:43,154 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:43,154 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:43,165 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:43,272 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-26 21:32:43,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:43,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:43,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:43,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:43,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:43,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:43,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:43,963 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-26 21:32:43,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 21:32:43,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 21:32:43,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:32:43,965 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-26 21:32:44,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:44,197 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 21:32:44,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 21:32:44,198 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-26 21:32:44,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:44,199 INFO L225 Difference]: With dead ends: 131 [2018-09-26 21:32:44,199 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 21:32:44,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 21:32:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 21:32:44,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-26 21:32:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 21:32:44,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 21:32:44,205 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-26 21:32:44,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:44,205 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 21:32:44,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 21:32:44,205 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 21:32:44,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 21:32:44,206 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:44,206 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-26 21:32:44,206 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:44,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:44,207 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-26 21:32:44,207 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:44,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:44,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:44,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:44,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:44,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:45,043 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:45,043 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:45,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:45,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:45,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:45,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:45,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:45,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:45,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:45,918 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:45,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-26 21:32:45,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 21:32:45,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 21:32:45,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:32:45,920 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-26 21:32:46,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:46,128 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 21:32:46,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 21:32:46,129 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-26 21:32:46,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:46,130 INFO L225 Difference]: With dead ends: 135 [2018-09-26 21:32:46,131 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 21:32:46,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 21:32:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 21:32:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-26 21:32:46,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 21:32:46,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 21:32:46,137 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-26 21:32:46,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:46,137 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 21:32:46,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 21:32:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 21:32:46,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 21:32:46,138 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:46,138 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-26 21:32:46,138 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:46,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:46,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-26 21:32:46,139 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:46,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:46,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:46,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:32:46,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:46,927 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:46,928 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:46,935 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:32:46,989 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:32:46,990 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:46,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:46,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:46,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:47,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:47,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:48,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:48,036 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:48,037 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-26 21:32:48,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 21:32:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 21:32:48,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:32:48,038 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-26 21:32:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:48,262 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 21:32:48,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 21:32:48,263 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-26 21:32:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:48,264 INFO L225 Difference]: With dead ends: 139 [2018-09-26 21:32:48,265 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 21:32:48,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 21:32:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 21:32:48,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-26 21:32:48,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 21:32:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 21:32:48,270 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-26 21:32:48,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:48,271 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 21:32:48,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 21:32:48,271 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 21:32:48,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 21:32:48,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:48,272 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-26 21:32:48,272 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:48,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:48,272 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-26 21:32:48,272 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:48,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:48,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:48,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:48,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:49,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:49,008 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:49,008 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:49,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:32:49,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-26 21:32:49,119 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:49,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:49,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:49,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:49,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:49,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:51,346 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:51,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-26 21:32:51,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 21:32:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 21:32:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:32:51,347 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-26 21:32:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:51,675 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 21:32:51,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 21:32:51,675 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-26 21:32:51,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:51,677 INFO L225 Difference]: With dead ends: 143 [2018-09-26 21:32:51,677 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 21:32:51,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 21:32:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 21:32:51,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-26 21:32:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 21:32:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 21:32:51,682 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-26 21:32:51,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:51,682 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 21:32:51,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 21:32:51,683 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 21:32:51,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 21:32:51,683 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:51,683 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-26 21:32:51,684 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:51,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:51,684 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-26 21:32:51,684 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:51,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:51,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:51,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:52,405 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:52,405 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:52,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:32:52,461 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:32:52,461 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:52,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:52,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:52,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:52,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:52,566 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:53,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:53,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-26 21:32:53,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 21:32:53,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 21:32:53,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 21:32:53,546 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-26 21:32:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:53,977 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 21:32:53,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 21:32:53,978 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-26 21:32:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:53,979 INFO L225 Difference]: With dead ends: 147 [2018-09-26 21:32:53,979 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 21:32:53,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 21:32:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 21:32:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-26 21:32:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 21:32:53,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 21:32:53,988 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-26 21:32:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:53,988 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 21:32:53,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 21:32:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 21:32:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 21:32:53,989 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:53,990 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-26 21:32:53,990 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-26 21:32:53,990 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:53,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:55,326 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:55,326 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:55,333 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:32:55,429 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-26 21:32:55,429 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:55,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:55,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:55,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:55,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:55,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:56,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:56,329 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-26 21:32:56,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 21:32:56,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 21:32:56,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:32:56,331 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-26 21:32:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:56,761 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 21:32:56,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 21:32:56,762 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-26 21:32:56,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:56,763 INFO L225 Difference]: With dead ends: 151 [2018-09-26 21:32:56,764 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 21:32:56,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 21:32:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 21:32:56,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-26 21:32:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 21:32:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 21:32:56,769 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-26 21:32:56,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:56,770 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 21:32:56,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 21:32:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 21:32:56,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 21:32:56,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:56,771 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-26 21:32:56,771 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:56,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:56,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-26 21:32:56,771 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:56,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:56,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:56,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:32:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:57,614 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:32:57,614 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:32:57,622 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:32:57,738 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-26 21:32:57,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:32:57,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:32:57,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:32:57,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:32:57,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:32:57,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:32:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:32:58,731 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:32:58,731 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-26 21:32:58,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 21:32:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 21:32:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 21:32:58,732 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-26 21:32:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:32:59,024 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 21:32:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 21:32:59,024 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-26 21:32:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:32:59,026 INFO L225 Difference]: With dead ends: 155 [2018-09-26 21:32:59,026 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 21:32:59,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 21:32:59,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 21:32:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-26 21:32:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 21:32:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 21:32:59,031 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-26 21:32:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:32:59,032 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 21:32:59,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 21:32:59,032 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 21:32:59,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 21:32:59,033 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:32:59,033 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-26 21:32:59,033 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:32:59,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:32:59,033 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-26 21:32:59,033 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:32:59,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:32:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:59,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:32:59,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:32:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:00,125 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:00,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:00,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:00,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:00,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:00,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:00,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:00,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:01,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:01,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-26 21:33:01,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 21:33:01,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 21:33:01,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:33:01,543 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-26 21:33:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:01,835 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 21:33:01,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 21:33:01,836 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-26 21:33:01,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:01,837 INFO L225 Difference]: With dead ends: 159 [2018-09-26 21:33:01,837 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 21:33:01,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 21:33:01,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 21:33:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-26 21:33:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 21:33:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 21:33:01,843 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-26 21:33:01,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:01,844 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 21:33:01,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 21:33:01,844 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 21:33:01,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 21:33:01,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:01,845 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-26 21:33:01,845 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:01,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:01,845 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-26 21:33:01,846 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:01,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:01,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:01,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:02,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:02,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:02,764 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:02,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:02,817 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:02,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:02,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:02,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:02,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:02,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:02,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:04,031 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:04,032 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-26 21:33:04,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 21:33:04,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 21:33:04,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 21:33:04,033 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-26 21:33:04,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:04,373 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 21:33:04,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 21:33:04,373 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-26 21:33:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:04,375 INFO L225 Difference]: With dead ends: 163 [2018-09-26 21:33:04,375 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 21:33:04,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 21:33:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 21:33:04,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-26 21:33:04,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 21:33:04,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 21:33:04,381 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-26 21:33:04,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:04,381 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 21:33:04,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 21:33:04,382 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 21:33:04,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 21:33:04,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:04,383 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-26 21:33:04,383 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:04,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-26 21:33:04,383 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:04,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:04,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:04,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:05,764 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:05,764 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:05,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:05,943 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-26 21:33:05,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:05,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:05,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:05,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:05,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:05,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:06,999 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:07,019 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:07,019 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-26 21:33:07,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 21:33:07,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 21:33:07,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:33:07,020 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-26 21:33:07,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:07,474 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 21:33:07,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 21:33:07,474 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-26 21:33:07,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:07,476 INFO L225 Difference]: With dead ends: 167 [2018-09-26 21:33:07,476 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 21:33:07,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 21:33:07,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 21:33:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-26 21:33:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 21:33:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 21:33:07,482 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-26 21:33:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:07,482 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 21:33:07,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 21:33:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 21:33:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 21:33:07,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:07,483 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-26 21:33:07,484 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:07,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-26 21:33:07,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:07,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:07,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:07,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:07,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:08,537 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:08,537 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:08,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:08,593 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:08,593 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:08,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:08,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:08,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:08,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:08,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:09,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:09,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:09,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-26 21:33:09,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 21:33:09,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 21:33:09,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 21:33:09,953 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-26 21:33:10,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:10,235 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 21:33:10,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 21:33:10,235 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-26 21:33:10,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:10,236 INFO L225 Difference]: With dead ends: 171 [2018-09-26 21:33:10,237 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 21:33:10,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 21:33:10,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 21:33:10,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-26 21:33:10,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 21:33:10,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 21:33:10,242 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-26 21:33:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:10,243 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 21:33:10,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 21:33:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 21:33:10,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 21:33:10,244 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:10,244 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-26 21:33:10,244 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:10,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:10,244 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-26 21:33:10,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:10,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:10,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:10,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:11,255 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:11,256 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:11,270 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:11,431 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-26 21:33:11,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:11,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:11,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:11,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:11,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:11,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:12,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:12,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-26 21:33:12,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 21:33:12,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 21:33:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:33:12,737 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-26 21:33:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:13,070 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 21:33:13,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 21:33:13,070 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-26 21:33:13,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:13,072 INFO L225 Difference]: With dead ends: 175 [2018-09-26 21:33:13,072 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 21:33:13,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 21:33:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 21:33:13,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-26 21:33:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 21:33:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 21:33:13,078 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-26 21:33:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:13,078 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 21:33:13,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 21:33:13,078 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 21:33:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 21:33:13,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:13,079 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-26 21:33:13,080 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:13,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-26 21:33:13,080 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:13,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:13,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:13,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:13,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:14,497 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:14,498 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:14,529 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:14,751 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-26 21:33:14,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:14,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:14,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:14,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:14,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:14,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:16,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:16,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-26 21:33:16,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 21:33:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 21:33:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 21:33:16,163 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-26 21:33:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:17,098 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 21:33:17,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 21:33:17,099 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-26 21:33:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:17,100 INFO L225 Difference]: With dead ends: 179 [2018-09-26 21:33:17,100 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 21:33:17,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 21:33:17,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 21:33:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-26 21:33:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 21:33:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 21:33:17,106 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-26 21:33:17,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:17,107 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 21:33:17,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 21:33:17,107 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 21:33:17,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 21:33:17,108 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:17,108 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-26 21:33:17,108 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:17,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:17,108 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-26 21:33:17,109 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:17,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:17,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:17,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:17,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:18,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:18,248 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:18,248 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:18,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:18,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:18,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:18,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:18,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:18,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:19,609 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:19,609 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-26 21:33:19,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 21:33:19,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 21:33:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 21:33:19,611 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-26 21:33:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:19,902 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 21:33:19,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 21:33:19,902 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-26 21:33:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:19,903 INFO L225 Difference]: With dead ends: 183 [2018-09-26 21:33:19,904 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 21:33:19,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 21:33:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 21:33:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-26 21:33:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 21:33:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 21:33:19,909 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-26 21:33:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:19,909 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 21:33:19,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 21:33:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 21:33:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 21:33:19,910 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:19,910 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-26 21:33:19,910 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:19,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-26 21:33:19,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:19,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:19,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:19,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:21,224 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:21,224 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:21,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:21,283 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:21,283 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:21,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:21,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:21,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:21,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:21,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:22,665 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:22,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-26 21:33:22,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 21:33:22,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 21:33:22,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:33:22,667 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-26 21:33:22,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:22,958 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 21:33:22,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 21:33:22,959 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-26 21:33:22,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:22,960 INFO L225 Difference]: With dead ends: 187 [2018-09-26 21:33:22,960 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 21:33:22,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 21:33:22,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 21:33:22,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-26 21:33:22,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 21:33:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 21:33:22,965 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-26 21:33:22,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:22,966 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 21:33:22,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 21:33:22,966 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 21:33:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 21:33:22,967 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:22,967 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-26 21:33:22,967 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:22,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-26 21:33:22,968 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:22,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:22,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:22,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:22,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:24,138 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:24,138 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:24,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:24,319 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-26 21:33:24,319 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:24,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:24,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:24,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:24,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:24,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:26,010 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:26,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-26 21:33:26,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 21:33:26,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 21:33:26,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:33:26,012 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-26 21:33:26,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:26,326 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 21:33:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 21:33:26,326 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-26 21:33:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:26,328 INFO L225 Difference]: With dead ends: 191 [2018-09-26 21:33:26,328 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 21:33:26,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 21:33:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 21:33:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-26 21:33:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 21:33:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 21:33:26,333 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-26 21:33:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:26,334 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 21:33:26,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 21:33:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 21:33:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 21:33:26,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:26,335 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-26 21:33:26,335 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:26,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-26 21:33:26,336 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:26,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:26,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:26,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:26,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:27,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:27,995 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:27,995 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:28,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:28,066 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:28,066 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:28,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:28,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:28,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:28,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:28,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:30,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:30,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-26 21:33:30,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 21:33:30,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 21:33:30,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 21:33:30,842 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-26 21:33:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:31,196 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 21:33:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 21:33:31,196 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-26 21:33:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:31,198 INFO L225 Difference]: With dead ends: 195 [2018-09-26 21:33:31,198 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 21:33:31,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 21:33:31,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 21:33:31,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-26 21:33:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 21:33:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 21:33:31,203 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-26 21:33:31,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:31,203 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 21:33:31,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 21:33:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 21:33:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 21:33:31,204 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:31,204 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-26 21:33:31,204 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:31,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-26 21:33:31,205 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:31,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:31,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:31,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:32,545 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:32,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:32,683 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-26 21:33:32,684 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:32,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:32,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:32,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:32,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:32,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:34,348 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:34,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-26 21:33:34,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 21:33:34,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 21:33:34,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:33:34,350 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-26 21:33:34,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:34,680 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 21:33:34,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 21:33:34,680 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-26 21:33:34,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:34,682 INFO L225 Difference]: With dead ends: 199 [2018-09-26 21:33:34,682 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 21:33:34,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 21:33:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 21:33:34,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-26 21:33:34,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 21:33:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 21:33:34,687 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-26 21:33:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:34,688 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 21:33:34,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 21:33:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 21:33:34,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 21:33:34,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:34,689 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-26 21:33:34,689 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:34,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:34,689 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-26 21:33:34,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:34,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:34,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:34,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:34,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:36,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:36,392 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:36,392 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:36,399 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:33:36,566 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-26 21:33:36,566 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:36,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:36,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:36,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:36,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:36,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:38,140 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:38,140 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-26 21:33:38,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 21:33:38,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 21:33:38,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:33:38,142 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-26 21:33:38,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:38,510 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 21:33:38,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 21:33:38,510 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-26 21:33:38,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:38,512 INFO L225 Difference]: With dead ends: 203 [2018-09-26 21:33:38,512 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 21:33:38,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 21:33:38,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 21:33:38,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-26 21:33:38,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 21:33:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 21:33:38,517 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-26 21:33:38,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:38,518 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 21:33:38,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 21:33:38,518 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 21:33:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 21:33:38,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:38,519 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-26 21:33:38,519 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:38,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-26 21:33:38,519 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:38,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:38,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:38,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:39,849 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:39,849 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:39,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:39,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:39,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:39,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:39,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:39,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:41,724 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:41,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-26 21:33:41,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 21:33:41,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 21:33:41,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:33:41,727 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-26 21:33:42,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:42,062 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 21:33:42,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 21:33:42,063 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-26 21:33:42,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:42,064 INFO L225 Difference]: With dead ends: 207 [2018-09-26 21:33:42,065 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 21:33:42,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 21:33:42,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 21:33:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-26 21:33:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 21:33:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 21:33:42,071 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-26 21:33:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:42,071 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 21:33:42,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 21:33:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 21:33:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 21:33:42,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:42,072 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-26 21:33:42,073 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:42,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-26 21:33:42,073 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:42,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:42,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:33:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:43,837 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:43,837 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:43,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:33:43,912 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:33:43,912 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:43,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:43,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:43,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:43,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:43,934 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:46,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:46,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-26 21:33:46,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 21:33:46,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 21:33:46,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 21:33:46,180 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-26 21:33:46,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:46,512 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 21:33:46,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 21:33:46,512 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-26 21:33:46,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:46,514 INFO L225 Difference]: With dead ends: 211 [2018-09-26 21:33:46,514 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 21:33:46,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 21:33:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 21:33:46,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-26 21:33:46,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 21:33:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 21:33:46,521 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-26 21:33:46,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:46,521 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 21:33:46,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 21:33:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 21:33:46,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 21:33:46,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:46,522 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-26 21:33:46,523 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:46,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:46,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-26 21:33:46,523 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:46,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:46,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:46,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:46,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:47,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:47,968 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:47,968 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:47,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:33:48,358 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-26 21:33:48,358 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:48,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:48,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:48,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:48,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:48,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:50,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:50,132 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:50,132 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-26 21:33:50,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 21:33:50,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 21:33:50,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:33:50,134 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-26 21:33:50,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:50,485 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 21:33:50,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 21:33:50,486 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-26 21:33:50,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:50,488 INFO L225 Difference]: With dead ends: 215 [2018-09-26 21:33:50,488 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 21:33:50,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 21:33:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 21:33:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-26 21:33:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 21:33:50,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 21:33:50,495 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-26 21:33:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:50,495 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 21:33:50,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 21:33:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 21:33:50,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 21:33:50,496 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:50,496 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-26 21:33:50,497 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:50,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:50,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-26 21:33:50,497 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:50,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:50,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:50,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:50,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:52,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:52,386 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:52,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:52,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:33:52,548 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:33:52,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:52,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:52,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:52,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:52,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:52,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:54,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:54,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-26 21:33:54,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 21:33:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 21:33:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 21:33:54,376 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-26 21:33:54,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:54,733 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 21:33:54,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 21:33:54,734 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-26 21:33:54,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:54,736 INFO L225 Difference]: With dead ends: 219 [2018-09-26 21:33:54,736 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 21:33:54,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 21:33:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 21:33:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-26 21:33:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 21:33:54,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 21:33:54,741 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-26 21:33:54,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:54,741 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 21:33:54,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 21:33:54,742 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 21:33:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 21:33:54,742 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:54,743 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-26 21:33:54,743 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:54,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:54,743 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-26 21:33:54,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:54,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:54,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:54,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:54,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:33:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:56,576 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:33:56,576 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:33:56,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:33:56,850 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-26 21:33:56,850 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:33:56,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:33:56,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:33:56,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:33:56,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:33:56,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:33:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:33:58,747 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:33:58,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-26 21:33:58,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 21:33:58,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 21:33:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:33:58,749 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-26 21:33:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:33:59,125 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-26 21:33:59,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 21:33:59,126 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-26 21:33:59,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:33:59,127 INFO L225 Difference]: With dead ends: 223 [2018-09-26 21:33:59,127 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 21:33:59,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 21:33:59,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 21:33:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-26 21:33:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 21:33:59,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 21:33:59,131 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-26 21:33:59,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:33:59,132 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 21:33:59,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 21:33:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 21:33:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 21:33:59,133 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:33:59,133 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-26 21:33:59,133 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:33:59,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:33:59,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-26 21:33:59,133 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:33:59,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:33:59,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:59,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:33:59,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:33:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:00,791 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:00,791 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:00,799 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:34:01,019 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-26 21:34:01,019 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:01,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:01,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:01,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:01,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:01,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:03,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:03,092 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:03,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-26 21:34:03,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 21:34:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 21:34:03,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 21:34:03,094 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-26 21:34:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:03,441 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 21:34:03,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 21:34:03,441 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-26 21:34:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:03,443 INFO L225 Difference]: With dead ends: 227 [2018-09-26 21:34:03,443 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 21:34:03,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 21:34:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 21:34:03,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-26 21:34:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 21:34:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 21:34:03,451 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-26 21:34:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:03,451 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 21:34:03,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 21:34:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 21:34:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 21:34:03,452 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:03,452 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-26 21:34:03,452 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:03,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:03,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-26 21:34:03,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:03,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:03,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:03,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:03,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:05,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:05,125 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:05,125 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:05,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:05,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:05,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:05,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:05,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:05,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:07,377 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:07,377 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-26 21:34:07,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 21:34:07,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 21:34:07,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 21:34:07,379 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-26 21:34:07,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:07,786 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 21:34:07,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 21:34:07,786 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-26 21:34:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:07,788 INFO L225 Difference]: With dead ends: 231 [2018-09-26 21:34:07,788 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 21:34:07,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 21:34:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 21:34:07,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-26 21:34:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 21:34:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 21:34:07,795 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-26 21:34:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:07,795 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 21:34:07,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 21:34:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 21:34:07,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 21:34:07,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:07,797 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-26 21:34:07,797 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:07,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:07,797 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-26 21:34:07,798 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:07,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:07,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:09,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:09,527 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:09,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:34:09,609 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:34:09,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:09,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:09,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:09,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:09,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:09,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:12,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:12,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-26 21:34:12,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 21:34:12,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 21:34:12,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:34:12,298 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-26 21:34:12,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:12,745 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 21:34:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 21:34:12,745 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-26 21:34:12,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:12,747 INFO L225 Difference]: With dead ends: 235 [2018-09-26 21:34:12,747 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 21:34:12,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 21:34:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 21:34:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-26 21:34:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 21:34:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 21:34:12,753 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-26 21:34:12,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:12,754 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 21:34:12,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 21:34:12,754 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 21:34:12,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 21:34:12,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:12,755 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-26 21:34:12,755 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:12,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-26 21:34:12,756 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:12,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:12,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:12,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:14,465 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:14,465 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:14,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:34:14,737 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-26 21:34:14,737 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:14,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:14,758 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:14,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:14,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:14,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:17,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:17,311 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:17,311 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-26 21:34:17,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 21:34:17,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 21:34:17,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:34:17,313 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-26 21:34:17,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:17,737 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-26 21:34:17,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 21:34:17,737 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-26 21:34:17,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:17,739 INFO L225 Difference]: With dead ends: 239 [2018-09-26 21:34:17,739 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 21:34:17,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 21:34:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 21:34:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-26 21:34:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 21:34:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 21:34:17,745 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-26 21:34:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:17,745 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 21:34:17,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 21:34:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 21:34:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 21:34:17,746 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:17,746 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-26 21:34:17,746 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:17,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:17,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-26 21:34:17,746 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:17,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:17,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:17,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:19,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:19,481 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:19,481 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:19,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:19,563 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:19,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:19,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:19,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:19,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:19,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:19,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:21,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:21,915 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-26 21:34:21,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 21:34:21,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 21:34:21,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 21:34:21,917 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-26 21:34:22,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:22,363 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-26 21:34:22,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 21:34:22,363 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-26 21:34:22,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:22,365 INFO L225 Difference]: With dead ends: 243 [2018-09-26 21:34:22,365 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 21:34:22,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 21:34:22,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 21:34:22,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-26 21:34:22,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 21:34:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 21:34:22,371 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-26 21:34:22,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:22,371 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 21:34:22,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 21:34:22,371 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 21:34:22,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 21:34:22,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:22,372 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-26 21:34:22,372 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:22,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-26 21:34:22,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:22,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:22,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:24,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:24,141 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:24,141 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:24,148 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:24,323 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-26 21:34:24,323 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:24,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:24,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:24,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:24,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:24,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:26,586 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:26,586 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-26 21:34:26,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 21:34:26,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 21:34:26,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 21:34:26,589 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-26 21:34:27,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:27,054 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-26 21:34:27,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 21:34:27,055 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-26 21:34:27,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:27,057 INFO L225 Difference]: With dead ends: 247 [2018-09-26 21:34:27,057 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 21:34:27,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 21:34:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 21:34:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-26 21:34:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 21:34:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 21:34:27,064 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-26 21:34:27,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:27,064 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 21:34:27,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 21:34:27,065 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 21:34:27,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 21:34:27,066 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:27,066 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-26 21:34:27,066 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:27,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-26 21:34:27,067 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:27,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:27,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:28,988 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:28,988 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:28,996 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:34:29,246 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-26 21:34:29,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:29,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:29,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:29,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:29,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:29,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:31,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:31,520 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-26 21:34:31,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 21:34:31,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 21:34:31,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 21:34:31,522 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-26 21:34:32,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:32,130 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-26 21:34:32,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 21:34:32,130 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-26 21:34:32,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:32,131 INFO L225 Difference]: With dead ends: 251 [2018-09-26 21:34:32,131 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 21:34:32,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 21:34:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 21:34:32,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-26 21:34:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 21:34:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-26 21:34:32,139 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-26 21:34:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:32,139 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-26 21:34:32,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 21:34:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-26 21:34:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 21:34:32,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:32,141 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-26 21:34:32,141 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:32,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:32,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-26 21:34:32,141 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:32,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:32,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:32,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:34,135 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:34,135 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:34,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:34,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:34,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:34,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:34,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:34,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:36,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:36,564 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-26 21:34:36,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 21:34:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 21:34:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 21:34:36,567 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-26 21:34:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:37,126 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 21:34:37,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 21:34:37,126 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-26 21:34:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:37,128 INFO L225 Difference]: With dead ends: 255 [2018-09-26 21:34:37,128 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 21:34:37,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 21:34:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 21:34:37,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-26 21:34:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 21:34:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-26 21:34:37,134 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-26 21:34:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:37,134 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-26 21:34:37,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 21:34:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-26 21:34:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 21:34:37,135 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:37,135 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-26 21:34:37,135 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:37,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-26 21:34:37,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:37,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:37,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:34:37,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:39,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:39,110 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:39,110 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:39,117 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:34:39,187 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:34:39,187 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:39,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:39,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:39,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:39,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:39,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:41,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:41,613 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-26 21:34:41,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 21:34:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 21:34:41,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 21:34:41,615 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-26 21:34:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:42,142 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-26 21:34:42,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 21:34:42,142 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-26 21:34:42,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:42,143 INFO L225 Difference]: With dead ends: 259 [2018-09-26 21:34:42,143 INFO L226 Difference]: Without dead ends: 258 [2018-09-26 21:34:42,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 21:34:42,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-26 21:34:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-26 21:34:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 21:34:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 21:34:42,149 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-26 21:34:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:42,149 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 21:34:42,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 21:34:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 21:34:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 21:34:42,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:42,150 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-26 21:34:42,150 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:42,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-26 21:34:42,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:42,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:42,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:42,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:42,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:44,233 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:44,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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:44,243 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:34:44,563 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-26 21:34:44,563 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:44,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:44,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:44,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:44,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:44,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:47,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:47,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-26 21:34:47,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 21:34:47,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 21:34:47,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 21:34:47,095 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-26 21:34:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:47,648 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-26 21:34:47,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 21:34:47,648 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-26 21:34:47,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:47,650 INFO L225 Difference]: With dead ends: 263 [2018-09-26 21:34:47,650 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 21:34:47,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 21:34:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 21:34:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-26 21:34:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 21:34:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-26 21:34:47,655 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-26 21:34:47,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:47,655 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-26 21:34:47,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 21:34:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-26 21:34:47,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 21:34:47,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:47,657 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-26 21:34:47,657 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:47,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:47,658 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-26 21:34:47,658 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:47,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:47,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:47,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:49,730 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:49,730 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:49,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:34:49,820 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:34:49,820 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:49,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:49,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:49,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:49,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:49,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:52,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:52,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-26 21:34:53,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 21:34:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 21:34:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:34:53,001 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-26 21:34:53,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:53,496 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-26 21:34:53,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 21:34:53,497 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-26 21:34:53,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:53,498 INFO L225 Difference]: With dead ends: 267 [2018-09-26 21:34:53,498 INFO L226 Difference]: Without dead ends: 266 [2018-09-26 21:34:53,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 21:34:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-26 21:34:53,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-26 21:34:53,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 21:34:53,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-26 21:34:53,505 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-26 21:34:53,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:53,506 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-26 21:34:53,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 21:34:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-26 21:34:53,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 21:34:53,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:53,507 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-26 21:34:53,508 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:53,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:53,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-26 21:34:53,508 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:53,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:53,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:53,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:34:55,666 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:55,667 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:34:55,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:34:55,674 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:34:55,881 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-26 21:34:55,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:34:55,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:34:55,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:34:55,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:34:55,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:34:55,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:34:58,746 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:34:58,767 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:34:58,767 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-26 21:34:58,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 21:34:58,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 21:34:58,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 21:34:58,769 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-26 21:34:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:34:59,274 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-26 21:34:59,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 21:34:59,274 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-26 21:34:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:34:59,276 INFO L225 Difference]: With dead ends: 271 [2018-09-26 21:34:59,276 INFO L226 Difference]: Without dead ends: 270 [2018-09-26 21:34:59,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8580 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 21:34:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-26 21:34:59,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-26 21:34:59,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 21:34:59,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-26 21:34:59,283 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-26 21:34:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:34:59,283 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-26 21:34:59,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 21:34:59,284 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-26 21:34:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 21:34:59,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:34:59,285 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-26 21:34:59,285 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:34:59,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:34:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-26 21:34:59,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:34:59,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:34:59,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:59,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:34:59,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:34:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:01,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:01,489 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:01,489 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:01,496 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:35:01,799 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-26 21:35:01,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:01,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:01,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:01,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:01,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:01,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:04,736 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:04,736 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-26 21:35:04,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 21:35:04,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 21:35:04,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 21:35:04,738 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-26 21:35:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:05,313 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-26 21:35:05,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 21:35:05,314 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-26 21:35:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:05,315 INFO L225 Difference]: With dead ends: 275 [2018-09-26 21:35:05,316 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 21:35:05,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 21:35:05,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 21:35:05,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-26 21:35:05,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 21:35:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-26 21:35:05,321 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-26 21:35:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:05,321 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-26 21:35:05,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 21:35:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-26 21:35:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 21:35:05,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:05,323 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-26 21:35:05,323 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:05,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:05,323 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-26 21:35:05,323 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:05,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:07,611 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:07,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:07,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:07,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:07,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:07,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:07,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:07,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:10,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:10,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-26 21:35:10,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 21:35:10,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 21:35:10,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 21:35:10,645 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-26 21:35:11,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:11,114 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-26 21:35:11,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 21:35:11,114 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-26 21:35:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:11,116 INFO L225 Difference]: With dead ends: 279 [2018-09-26 21:35:11,116 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 21:35:11,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 21:35:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 21:35:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-26 21:35:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 21:35:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-26 21:35:11,122 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-26 21:35:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:11,122 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-26 21:35:11,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 21:35:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-26 21:35:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 21:35:11,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:11,124 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-26 21:35:11,124 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:11,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:11,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-26 21:35:11,125 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:11,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:11,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:13,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:13,776 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:13,776 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:13,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:35:13,862 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:35:13,862 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:13,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:13,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:13,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:13,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:13,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:16,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:16,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:16,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-26 21:35:16,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 21:35:16,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 21:35:16,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 21:35:16,779 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-26 21:35:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:17,339 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-26 21:35:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 21:35:17,339 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-26 21:35:17,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:17,341 INFO L225 Difference]: With dead ends: 283 [2018-09-26 21:35:17,341 INFO L226 Difference]: Without dead ends: 282 [2018-09-26 21:35:17,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9384 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 21:35:17,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-26 21:35:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-26 21:35:17,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 21:35:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 21:35:17,347 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-26 21:35:17,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:17,348 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 21:35:17,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 21:35:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 21:35:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 21:35:17,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:17,349 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-26 21:35:17,350 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:17,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-26 21:35:17,350 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:17,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:20,027 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:20,027 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:20,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:35:20,419 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-26 21:35:20,419 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:20,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:20,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:20,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:20,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:20,441 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:23,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:23,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-26 21:35:23,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 21:35:23,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 21:35:23,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 21:35:23,534 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-26 21:35:24,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:24,020 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-26 21:35:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 21:35:24,021 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-26 21:35:24,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:24,022 INFO L225 Difference]: With dead ends: 287 [2018-09-26 21:35:24,023 INFO L226 Difference]: Without dead ends: 286 [2018-09-26 21:35:24,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 21:35:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-26 21:35:24,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-26 21:35:24,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 21:35:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-26 21:35:24,029 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-26 21:35:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:24,029 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-26 21:35:24,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 21:35:24,029 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-26 21:35:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 21:35:24,030 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:24,030 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-26 21:35:24,031 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:24,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:24,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-26 21:35:24,031 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:24,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:24,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:24,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:24,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:26,547 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:26,547 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:26,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:35:26,650 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:35:26,650 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:26,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:26,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:26,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:26,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:26,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:30,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:30,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:30,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-26 21:35:30,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 21:35:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 21:35:30,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 21:35:30,074 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-26 21:35:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:30,709 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-26 21:35:30,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 21:35:30,710 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-26 21:35:30,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:30,712 INFO L225 Difference]: With dead ends: 291 [2018-09-26 21:35:30,712 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 21:35:30,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 21:35:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 21:35:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-26 21:35:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 21:35:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-26 21:35:30,718 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-26 21:35:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:30,718 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-26 21:35:30,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 21:35:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-26 21:35:30,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 21:35:30,719 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:30,719 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-26 21:35:30,719 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:30,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:30,720 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-26 21:35:30,720 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:30,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:30,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:30,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:33,479 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:33,479 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:33,487 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-26 21:35:33,732 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-26 21:35:33,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:33,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:33,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:33,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:33,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:33,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:36,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:36,822 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:36,822 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-26 21:35:36,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 21:35:36,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 21:35:36,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 21:35:36,826 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-26 21:35:37,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:37,405 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-26 21:35:37,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 21:35:37,406 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-26 21:35:37,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:37,407 INFO L225 Difference]: With dead ends: 295 [2018-09-26 21:35:37,408 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 21:35:37,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 21:35:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 21:35:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-26 21:35:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 21:35:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-26 21:35:37,414 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-26 21:35:37,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:37,414 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-26 21:35:37,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 21:35:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-26 21:35:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 21:35:37,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:37,416 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-26 21:35:37,416 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:37,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-26 21:35:37,416 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:37,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:37,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:40,144 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:40,144 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:40,151 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-26 21:35:40,533 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-26 21:35:40,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:40,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:40,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:40,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:40,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:40,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:43,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:43,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-26 21:35:43,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 21:35:43,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 21:35:43,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 21:35:43,902 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-26 21:35:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:44,424 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-26 21:35:44,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 21:35:44,425 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-26 21:35:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:44,427 INFO L225 Difference]: With dead ends: 299 [2018-09-26 21:35:44,427 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 21:35:44,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 21:35:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 21:35:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-26 21:35:44,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 21:35:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-26 21:35:44,433 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-26 21:35:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:44,433 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-26 21:35:44,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 21:35:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-26 21:35:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 21:35:44,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:44,434 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-26 21:35:44,435 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:44,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-26 21:35:44,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:44,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:44,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:44,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:47,159 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:47,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:47,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:47,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:47,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:47,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:47,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:47,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:50,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:50,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-26 21:35:50,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 21:35:50,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 21:35:50,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 21:35:50,559 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-26 21:35:51,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:51,055 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-26 21:35:51,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 21:35:51,056 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-26 21:35:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:51,057 INFO L225 Difference]: With dead ends: 303 [2018-09-26 21:35:51,058 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 21:35:51,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 21:35:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 21:35:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-26 21:35:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 21:35:51,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-26 21:35:51,063 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-26 21:35:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:51,063 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-26 21:35:51,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 21:35:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-26 21:35:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 21:35:51,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:51,065 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-26 21:35:51,065 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:51,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:51,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-26 21:35:51,065 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:51,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:51,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:35:51,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:35:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:53,856 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:35:53,856 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:35:53,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:35:53,949 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:35:53,949 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:35:53,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:35:53,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:35:53,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:35:53,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:35:53,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:35:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:35:57,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:35:57,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-26 21:35:57,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 21:35:57,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 21:35:57,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 21:35:57,292 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-26 21:35:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:35:57,821 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-26 21:35:57,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 21:35:57,821 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-26 21:35:57,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:35:57,823 INFO L225 Difference]: With dead ends: 307 [2018-09-26 21:35:57,823 INFO L226 Difference]: Without dead ends: 306 [2018-09-26 21:35:57,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 21:35:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-26 21:35:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-26 21:35:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 21:35:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-26 21:35:57,830 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-26 21:35:57,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:35:57,830 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-26 21:35:57,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 21:35:57,830 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-26 21:35:57,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 21:35:57,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:35:57,832 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-26 21:35:57,832 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:35:57,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:35:57,832 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-26 21:35:57,832 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:35:57,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:35:57,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:57,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:35:57,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:35:57,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:36:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:00,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:36:00,707 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:36:00,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-26 21:36:01,159 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-26 21:36:01,159 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:36:01,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:36:01,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:36:01,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:36:01,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:36:01,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-26 21:36:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:04,591 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:36:04,591 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-09-26 21:36:04,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 21:36:04,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 21:36:04,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 21:36:04,595 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-26 21:36:05,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:36:05,148 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-26 21:36:05,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 21:36:05,148 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-09-26 21:36:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:36:05,150 INFO L225 Difference]: With dead ends: 311 [2018-09-26 21:36:05,150 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 21:36:05,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 21:36:05,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 21:36:05,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-09-26 21:36:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 21:36:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-26 21:36:05,157 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-09-26 21:36:05,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:36:05,157 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-26 21:36:05,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 21:36:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-26 21:36:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 21:36:05,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:36:05,158 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-09-26 21:36:05,158 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:36:05,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 21:36:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-09-26 21:36:05,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:36:05,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:36:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:05,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:36:05,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:36:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:36:08,074 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:36:08,074 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:36:08,074 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:36:08,081 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-26 21:36:08,181 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-26 21:36:08,181 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:36:08,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:36:08,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-26 21:36:08,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-26 21:36:08,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-26 21:36:08,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 Received shutdown request... [2018-09-26 21:36:09,083 WARN L186 SmtUtils]: Removed 1 from assertion stack [2018-09-26 21:36:09,083 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-26 21:36:09,284 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:36:09,284 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 21:36:09,290 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 21:36:09,290 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:36:09 BoogieIcfgContainer [2018-09-26 21:36:09,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:36:09,291 INFO L168 Benchmark]: Toolchain (without parser) took 240942.13 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-09-26 21:36:09,292 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:09,292 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:09,292 INFO L168 Benchmark]: Boogie Preprocessor took 21.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 21:36:09,292 INFO L168 Benchmark]: RCFGBuilder took 389.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-09-26 21:36:09,293 INFO L168 Benchmark]: TraceAbstraction took 240462.90 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2018-09-26 21:36:09,294 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.69 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.97 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 389.99 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 240462.90 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.1 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 17). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 9. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 240.3s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 24.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 230 SDtfs, 4233 SDslu, 4299 SDs, 0 SdLazy, 15998 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 182.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=309occurred in iteration=76, 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, 76 MinimizatonAttempts, 76 StatesRemovedByMinimization, 76 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 195.3s InterpolantComputationTime, 23404 NumberOfCodeBlocks, 23404 NumberOfCodeBlocksAsserted, 1607 NumberOfCheckSat, 23253 ConstructedInterpolants, 0 QuantifiedInterpolants, 37828463 SizeOfPredicates, 450 NumberOfNonLiveVariables, 21675 ConjunctsInSsa, 9300 ConjunctsInUnsatCore, 151 InterpolantComputations, 1 PerfectInterpolantSequences, 0/579500 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-36-09-303.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified02.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-36-09-303.csv Completed graceful shutdown