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-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-bd42740 [2018-09-23 21:37:28,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-23 21:37:28,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-23 21:37:28,027 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-23 21:37:28,028 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-23 21:37:28,029 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-23 21:37:28,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-23 21:37:28,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-23 21:37:28,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-23 21:37:28,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-23 21:37:28,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-23 21:37:28,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-23 21:37:28,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-23 21:37:28,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-23 21:37:28,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-23 21:37:28,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-23 21:37:28,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-23 21:37:28,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-23 21:37:28,043 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-23 21:37:28,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-23 21:37:28,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-23 21:37:28,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-23 21:37:28,050 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-23 21:37:28,050 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-23 21:37:28,050 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-23 21:37:28,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-23 21:37:28,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-23 21:37:28,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-23 21:37:28,054 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-23 21:37:28,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-23 21:37:28,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-23 21:37:28,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-23 21:37:28,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-23 21:37:28,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-23 21:37:28,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-23 21:37:28,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-23 21:37:28,062 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-23 21:37:28,092 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-23 21:37:28,092 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-23 21:37:28,094 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-23 21:37:28,094 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-23 21:37:28,095 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-23 21:37:28,095 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-23 21:37:28,095 INFO L133 SettingsManager]: * Use SBE=true [2018-09-23 21:37:28,096 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-23 21:37:28,096 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-23 21:37:28,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-23 21:37:28,098 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-23 21:37:28,098 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-23 21:37:28,098 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-23 21:37:28,098 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-23 21:37:28,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-23 21:37:28,099 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-23 21:37:28,099 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-23 21:37:28,099 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-23 21:37:28,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-23 21:37:28,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-23 21:37:28,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-23 21:37:28,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-23 21:37:28,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-23 21:37:28,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-23 21:37:28,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-23 21:37:28,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-23 21:37:28,102 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-23 21:37:28,102 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-23 21:37:28,103 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-23 21:37:28,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-23 21:37:28,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-23 21:37:28,190 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-23 21:37:28,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-23 21:37:28,197 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-23 21:37:28,198 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-23 21:37:28,199 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-09-23 21:37:28,199 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-09-23 21:37:28,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-23 21:37:28,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-23 21:37:28,256 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-23 21:37:28,256 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-23 21:37:28,257 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-23 21:37:28,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,299 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-23 21:37:28,299 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-23 21:37:28,299 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-23 21:37:28,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-23 21:37:28,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-23 21:37:28,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-23 21:37:28,316 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-23 21:37:28,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/1) ... [2018-09-23 21:37:28,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-23 21:37:28,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-23 21:37:28,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-23 21:37:28,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-23 21:37:28,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (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-23 21:37:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-23 21:37:28,418 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-23 21:37:28,418 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-09-23 21:37:28,709 INFO L351 CfgBuilder]: Using library mode [2018-09-23 21:37:28,710 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:37:28 BoogieIcfgContainer [2018-09-23 21:37:28,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-23 21:37:28,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-23 21:37:28,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-23 21:37:28,715 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-23 21:37:28,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.09 09:37:28" (1/2) ... [2018-09-23 21:37:28,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783fb141 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.09 09:37:28, skipping insertion in model container [2018-09-23 21:37:28,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.09 09:37:28" (2/2) ... [2018-09-23 21:37:28,718 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-09-23 21:37:28,729 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-23 21:37:28,738 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-23 21:37:28,835 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-23 21:37:28,837 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-23 21:37:28,837 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-23 21:37:28,837 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-23 21:37:28,838 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-23 21:37:28,838 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-23 21:37:28,838 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-23 21:37:28,838 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-23 21:37:28,839 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-23 21:37:28,857 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states. [2018-09-23 21:37:28,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-23 21:37:28,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:28,867 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-23 21:37:28,868 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:28,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2018-09-23 21:37:28,879 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:28,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:29,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:29,134 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-23 21:37:29,136 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-23 21:37:29,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-23 21:37:29,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-23 21:37:29,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-23 21:37:29,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-23 21:37:29,154 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2018-09-23 21:37:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:29,216 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-23 21:37:29,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-23 21:37:29,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-23 21:37:29,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:29,231 INFO L225 Difference]: With dead ends: 17 [2018-09-23 21:37:29,231 INFO L226 Difference]: Without dead ends: 10 [2018-09-23 21:37:29,235 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-23 21:37:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-23 21:37:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-09-23 21:37:29,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-23 21:37:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-23 21:37:29,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 4 [2018-09-23 21:37:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:29,273 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-23 21:37:29,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-23 21:37:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-23 21:37:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-23 21:37:29,274 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:29,274 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-09-23 21:37:29,275 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:29,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1951667359, now seen corresponding path program 1 times [2018-09-23 21:37:29,275 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:29,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:29,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:29,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:29,377 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-23 21:37:29,378 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:29,378 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-23 21:37:29,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:29,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:29,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-23 21:37:29,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:29,600 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-23 21:37:29,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:29,903 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-23 21:37:29,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:29,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2018-09-23 21:37:29,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-23 21:37:29,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-23 21:37:29,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 21:37:29,940 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2018-09-23 21:37:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:30,092 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-23 21:37:30,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-23 21:37:30,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2018-09-23 21:37:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:30,094 INFO L225 Difference]: With dead ends: 15 [2018-09-23 21:37:30,094 INFO L226 Difference]: Without dead ends: 14 [2018-09-23 21:37:30,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-23 21:37:30,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-23 21:37:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-09-23 21:37:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-23 21:37:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-23 21:37:30,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-09-23 21:37:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:30,100 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-23 21:37:30,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-23 21:37:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-23 21:37:30,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-23 21:37:30,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:30,102 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1] [2018-09-23 21:37:30,102 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:30,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:30,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1291763032, now seen corresponding path program 2 times [2018-09-23 21:37:30,103 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:30,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:30,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:30,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:30,257 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-23 21:37:30,257 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:30,258 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-23 21:37:30,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:37:30,314 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:37:30,314 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:30,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:30,331 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-23 21:37:30,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:30,426 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-23 21:37:30,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:30,625 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-23 21:37:30,646 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:30,646 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2018-09-23 21:37:30,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-23 21:37:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-23 21:37:30,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-23 21:37:30,648 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 8 states. [2018-09-23 21:37:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:30,753 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-23 21:37:30,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-23 21:37:30,754 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-09-23 21:37:30,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:30,756 INFO L225 Difference]: With dead ends: 19 [2018-09-23 21:37:30,756 INFO L226 Difference]: Without dead ends: 18 [2018-09-23 21:37:30,757 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-23 21:37:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-23 21:37:30,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-23 21:37:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-23 21:37:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-23 21:37:30,762 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 12 [2018-09-23 21:37:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:30,762 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-23 21:37:30,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-23 21:37:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-23 21:37:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-23 21:37:30,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:30,763 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1] [2018-09-23 21:37:30,764 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:30,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:30,764 INFO L82 PathProgramCache]: Analyzing trace with hash 172253585, now seen corresponding path program 3 times [2018-09-23 21:37:30,765 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:30,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:30,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:30,766 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:30,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:30,875 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-23 21:37:30,875 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:30,877 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-23 21:37:30,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:37:30,931 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-23 21:37:30,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:30,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:30,955 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-23 21:37:30,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:31,011 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-23 21:37:31,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:31,160 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-23 21:37:31,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:31,186 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2018-09-23 21:37:31,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-23 21:37:31,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-23 21:37:31,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-23 21:37:31,187 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2018-09-23 21:37:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:31,288 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-23 21:37:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-23 21:37:31,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-23 21:37:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:31,290 INFO L225 Difference]: With dead ends: 23 [2018-09-23 21:37:31,290 INFO L226 Difference]: Without dead ends: 22 [2018-09-23 21:37:31,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-09-23 21:37:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-23 21:37:31,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-09-23 21:37:31,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-23 21:37:31,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-23 21:37:31,296 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2018-09-23 21:37:31,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:31,296 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-23 21:37:31,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-23 21:37:31,297 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-23 21:37:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-23 21:37:31,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:31,298 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1] [2018-09-23 21:37:31,298 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:31,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1489288886, now seen corresponding path program 4 times [2018-09-23 21:37:31,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:31,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:31,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:31,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:31,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:31,452 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-23 21:37:31,452 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:31,452 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-23 21:37:31,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:37:31,481 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:37:31,481 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:31,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:31,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 21:37:31,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:31,514 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-23 21:37:31,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:31,920 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-23 21:37:31,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:31,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2018-09-23 21:37:31,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-23 21:37:31,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-23 21:37:31,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-23 21:37:31,945 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2018-09-23 21:37:32,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:32,030 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-23 21:37:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-23 21:37:32,031 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2018-09-23 21:37:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:32,032 INFO L225 Difference]: With dead ends: 27 [2018-09-23 21:37:32,032 INFO L226 Difference]: Without dead ends: 26 [2018-09-23 21:37:32,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-09-23 21:37:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-23 21:37:32,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-09-23 21:37:32,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-23 21:37:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-23 21:37:32,037 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 20 [2018-09-23 21:37:32,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:32,038 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-23 21:37:32,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-23 21:37:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-23 21:37:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-23 21:37:32,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:32,039 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1] [2018-09-23 21:37:32,040 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:32,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:32,040 INFO L82 PathProgramCache]: Analyzing trace with hash 702127235, now seen corresponding path program 5 times [2018-09-23 21:37:32,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:32,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:32,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:32,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:32,303 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-23 21:37:32,304 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:32,304 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:37:32,312 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:37:32,332 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-09-23 21:37:32,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:32,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:32,350 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-23 21:37:32,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:32,364 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-23 21:37:32,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:32,523 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-23 21:37:32,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:32,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2018-09-23 21:37:32,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-23 21:37:32,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-23 21:37:32,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-23 21:37:32,544 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 14 states. [2018-09-23 21:37:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:32,620 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-23 21:37:32,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-23 21:37:32,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-09-23 21:37:32,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:32,626 INFO L225 Difference]: With dead ends: 31 [2018-09-23 21:37:32,626 INFO L226 Difference]: Without dead ends: 30 [2018-09-23 21:37:32,626 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-23 21:37:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-23 21:37:32,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-23 21:37:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-23 21:37:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-23 21:37:32,631 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 24 [2018-09-23 21:37:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:32,632 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-23 21:37:32,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-23 21:37:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-23 21:37:32,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-23 21:37:32,633 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:32,633 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1] [2018-09-23 21:37:32,633 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:32,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:32,634 INFO L82 PathProgramCache]: Analyzing trace with hash 854963004, now seen corresponding path program 6 times [2018-09-23 21:37:32,634 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:32,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:32,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:32,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:32,772 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-23 21:37:32,773 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:32,773 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-23 21:37:32,790 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:37:32,833 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-09-23 21:37:32,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:32,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:32,847 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-23 21:37:32,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:32,859 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-23 21:37:32,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:33,070 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-23 21:37:33,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:33,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2018-09-23 21:37:33,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-23 21:37:33,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-23 21:37:33,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-09-23 21:37:33,092 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 16 states. [2018-09-23 21:37:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:33,172 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-23 21:37:33,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-23 21:37:33,173 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-23 21:37:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:33,174 INFO L225 Difference]: With dead ends: 35 [2018-09-23 21:37:33,174 INFO L226 Difference]: Without dead ends: 34 [2018-09-23 21:37:33,175 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-23 21:37:33,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-23 21:37:33,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-09-23 21:37:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-23 21:37:33,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-23 21:37:33,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 28 [2018-09-23 21:37:33,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:33,181 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-23 21:37:33,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-23 21:37:33,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-23 21:37:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-23 21:37:33,183 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:33,183 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1] [2018-09-23 21:37:33,183 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:33,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:33,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1908030091, now seen corresponding path program 7 times [2018-09-23 21:37:33,184 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:33,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:33,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:33,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:33,332 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-23 21:37:33,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:33,333 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-23 21:37:33,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:33,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:33,386 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-23 21:37:33,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:33,405 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-23 21:37:33,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:33,574 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-23 21:37:33,603 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:33,603 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2018-09-23 21:37:33,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-23 21:37:33,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-23 21:37:33,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-09-23 21:37:33,605 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 18 states. [2018-09-23 21:37:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:33,851 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-23 21:37:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-23 21:37:33,853 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-09-23 21:37:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:33,854 INFO L225 Difference]: With dead ends: 39 [2018-09-23 21:37:33,854 INFO L226 Difference]: Without dead ends: 38 [2018-09-23 21:37:33,855 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-23 21:37:33,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-23 21:37:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-09-23 21:37:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-23 21:37:33,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-23 21:37:33,867 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 32 [2018-09-23 21:37:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:33,868 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-23 21:37:33,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-23 21:37:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-23 21:37:33,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-23 21:37:33,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:33,872 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1] [2018-09-23 21:37:33,872 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:33,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:33,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1033891026, now seen corresponding path program 8 times [2018-09-23 21:37:33,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:33,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:33,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:33,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:34,127 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-23 21:37:34,127 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:34,127 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-23 21:37:34,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:37:34,182 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:37:34,183 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:34,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:34,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-23 21:37:34,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:34,228 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-23 21:37:34,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:34,451 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-23 21:37:34,471 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:34,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2018-09-23 21:37:34,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-23 21:37:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-23 21:37:34,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-09-23 21:37:34,473 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-09-23 21:37:34,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:34,604 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-23 21:37:34,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-23 21:37:34,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-09-23 21:37:34,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:34,606 INFO L225 Difference]: With dead ends: 43 [2018-09-23 21:37:34,606 INFO L226 Difference]: Without dead ends: 42 [2018-09-23 21:37:34,607 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-23 21:37:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-23 21:37:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-23 21:37:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-23 21:37:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-23 21:37:34,613 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 36 [2018-09-23 21:37:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:34,614 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-23 21:37:34,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-23 21:37:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-23 21:37:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-23 21:37:34,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:34,615 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1] [2018-09-23 21:37:34,615 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:34,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:34,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1598366617, now seen corresponding path program 9 times [2018-09-23 21:37:34,616 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:34,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:34,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:34,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:34,799 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-23 21:37:34,800 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:34,800 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-23 21:37:34,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:37:34,832 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-23 21:37:34,833 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:34,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:34,841 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-23 21:37:34,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:34,852 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-23 21:37:34,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:35,230 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-23 21:37:35,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:35,250 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2018-09-23 21:37:35,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-23 21:37:35,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-23 21:37:35,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 21:37:35,252 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 22 states. [2018-09-23 21:37:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:35,381 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-23 21:37:35,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-23 21:37:35,382 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-09-23 21:37:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:35,383 INFO L225 Difference]: With dead ends: 47 [2018-09-23 21:37:35,383 INFO L226 Difference]: Without dead ends: 46 [2018-09-23 21:37:35,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-23 21:37:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-23 21:37:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-09-23 21:37:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-23 21:37:35,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-23 21:37:35,393 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 40 [2018-09-23 21:37:35,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:35,394 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-23 21:37:35,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-23 21:37:35,394 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-23 21:37:35,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-23 21:37:35,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:35,398 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1] [2018-09-23 21:37:35,398 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:35,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:35,399 INFO L82 PathProgramCache]: Analyzing trace with hash -710123232, now seen corresponding path program 10 times [2018-09-23 21:37:35,399 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:35,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:35,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:35,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:36,206 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-23 21:37:36,207 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:36,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 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-23 21:37:36,216 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:37:36,274 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:37:36,275 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:36,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:36,304 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-23 21:37:36,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:36,388 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-23 21:37:36,389 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:36,846 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-23 21:37:36,868 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:36,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2018-09-23 21:37:36,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-23 21:37:36,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-23 21:37:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-23 21:37:36,870 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 24 states. [2018-09-23 21:37:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:36,978 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-23 21:37:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-23 21:37:36,978 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-23 21:37:36,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:36,980 INFO L225 Difference]: With dead ends: 51 [2018-09-23 21:37:36,980 INFO L226 Difference]: Without dead ends: 50 [2018-09-23 21:37:36,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-09-23 21:37:36,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-23 21:37:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-09-23 21:37:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-23 21:37:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-23 21:37:36,986 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 44 [2018-09-23 21:37:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:36,987 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-23 21:37:36,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-23 21:37:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-23 21:37:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-23 21:37:36,988 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:36,988 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1] [2018-09-23 21:37:36,988 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:36,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash 2020270425, now seen corresponding path program 11 times [2018-09-23 21:37:36,989 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:36,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:36,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:36,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:36,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:37,223 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-23 21:37:37,223 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:37,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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-09-23 21:37:37,236 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-23 21:37:37,307 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-23 21:37:37,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:37,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:37,319 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-23 21:37:37,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:37,346 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-23 21:37:37,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:37,797 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-23 21:37:37,818 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:37,818 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2018-09-23 21:37:37,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-23 21:37:37,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-23 21:37:37,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:37:37,819 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 26 states. [2018-09-23 21:37:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:37,930 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-23 21:37:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-23 21:37:37,930 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-09-23 21:37:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:37,931 INFO L225 Difference]: With dead ends: 55 [2018-09-23 21:37:37,931 INFO L226 Difference]: Without dead ends: 54 [2018-09-23 21:37:37,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-09-23 21:37:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-23 21:37:37,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-23 21:37:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-23 21:37:37,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-23 21:37:37,937 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 48 [2018-09-23 21:37:37,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:37,937 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-23 21:37:37,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-23 21:37:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-23 21:37:37,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-23 21:37:37,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:37,939 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1] [2018-09-23 21:37:37,939 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:37,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1693672174, now seen corresponding path program 12 times [2018-09-23 21:37:37,940 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:37,940 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:37,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:37,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:38,234 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-23 21:37:38,234 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:38,234 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-23 21:37:38,241 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:37:38,307 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-23 21:37:38,307 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:38,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:38,329 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-23 21:37:38,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:38,367 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-23 21:37:38,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:38,583 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-23 21:37:38,604 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:38,605 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2018-09-23 21:37:38,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-23 21:37:38,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-23 21:37:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-23 21:37:38,606 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 28 states. [2018-09-23 21:37:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:38,736 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-23 21:37:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-23 21:37:38,736 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-09-23 21:37:38,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:38,737 INFO L225 Difference]: With dead ends: 59 [2018-09-23 21:37:38,737 INFO L226 Difference]: Without dead ends: 58 [2018-09-23 21:37:38,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-09-23 21:37:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-23 21:37:38,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-09-23 21:37:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-23 21:37:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-23 21:37:38,746 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 52 [2018-09-23 21:37:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:38,746 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-23 21:37:38,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-23 21:37:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-23 21:37:38,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-23 21:37:38,747 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:38,747 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1] [2018-09-23 21:37:38,748 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:38,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:38,748 INFO L82 PathProgramCache]: Analyzing trace with hash -628632501, now seen corresponding path program 13 times [2018-09-23 21:37:38,748 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:38,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:38,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:38,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:38,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:39,177 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-23 21:37:39,178 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:39,178 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-23 21:37:39,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:39,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:39,212 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-23 21:37:39,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:39,218 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-23 21:37:39,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:39,543 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-23 21:37:39,572 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:39,572 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 28 [2018-09-23 21:37:39,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-23 21:37:39,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-23 21:37:39,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-23 21:37:39,574 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2018-09-23 21:37:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:39,753 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-23 21:37:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-23 21:37:39,753 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2018-09-23 21:37:39,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:39,755 INFO L225 Difference]: With dead ends: 63 [2018-09-23 21:37:39,755 INFO L226 Difference]: Without dead ends: 62 [2018-09-23 21:37:39,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-09-23 21:37:39,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-23 21:37:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-09-23 21:37:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-23 21:37:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-23 21:37:39,761 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 56 [2018-09-23 21:37:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:39,762 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-23 21:37:39,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-23 21:37:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-23 21:37:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-23 21:37:39,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:39,763 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1] [2018-09-23 21:37:39,763 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:39,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash -290273532, now seen corresponding path program 14 times [2018-09-23 21:37:39,764 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:39,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:39,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:40,078 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-23 21:37:40,078 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:40,079 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-23 21:37:40,092 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:37:40,107 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:37:40,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:40,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:40,118 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-23 21:37:40,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:40,126 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-23 21:37:40,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:40,492 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-23 21:37:40,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:40,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 30 [2018-09-23 21:37:40,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-23 21:37:40,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-23 21:37:40,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 21:37:40,515 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 32 states. [2018-09-23 21:37:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:40,640 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-23 21:37:40,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-23 21:37:40,640 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-09-23 21:37:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:40,641 INFO L225 Difference]: With dead ends: 67 [2018-09-23 21:37:40,641 INFO L226 Difference]: Without dead ends: 66 [2018-09-23 21:37:40,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-23 21:37:40,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-23 21:37:40,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-23 21:37:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-23 21:37:40,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-23 21:37:40,649 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 60 [2018-09-23 21:37:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:40,649 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-23 21:37:40,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-23 21:37:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-23 21:37:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-23 21:37:40,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:40,651 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1] [2018-09-23 21:37:40,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:40,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:40,651 INFO L82 PathProgramCache]: Analyzing trace with hash 977515837, now seen corresponding path program 15 times [2018-09-23 21:37:40,651 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:40,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:40,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:40,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:41,060 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-23 21:37:41,060 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:41,060 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-23 21:37:41,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:37:41,101 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-09-23 21:37:41,101 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:41,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:41,122 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-23 21:37:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:41,132 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-23 21:37:41,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:41,411 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-23 21:37:41,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:41,432 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2018-09-23 21:37:41,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-23 21:37:41,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-23 21:37:41,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-09-23 21:37:41,433 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 34 states. [2018-09-23 21:37:41,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:41,672 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-23 21:37:41,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-23 21:37:41,673 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-09-23 21:37:41,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:41,673 INFO L225 Difference]: With dead ends: 71 [2018-09-23 21:37:41,674 INFO L226 Difference]: Without dead ends: 70 [2018-09-23 21:37:41,675 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-23 21:37:41,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-23 21:37:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-09-23 21:37:41,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-23 21:37:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-23 21:37:41,681 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 64 [2018-09-23 21:37:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:41,681 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-23 21:37:41,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-23 21:37:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-23 21:37:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-23 21:37:41,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:41,683 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1] [2018-09-23 21:37:41,683 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:41,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1523638006, now seen corresponding path program 16 times [2018-09-23 21:37:41,683 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:41,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:41,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:42,204 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-23 21:37:42,204 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:42,205 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-23 21:37:42,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:37:42,235 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:37:42,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:42,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:42,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 21:37:42,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:42,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-23 21:37:42,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:42,742 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-23 21:37:42,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:42,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 34 [2018-09-23 21:37:42,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-23 21:37:42,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-23 21:37:42,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 21:37:42,764 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 36 states. [2018-09-23 21:37:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:42,907 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-23 21:37:42,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-23 21:37:42,908 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 68 [2018-09-23 21:37:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:42,908 INFO L225 Difference]: With dead ends: 75 [2018-09-23 21:37:42,908 INFO L226 Difference]: Without dead ends: 74 [2018-09-23 21:37:42,909 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-09-23 21:37:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-23 21:37:42,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-09-23 21:37:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-23 21:37:42,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-23 21:37:42,914 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 68 [2018-09-23 21:37:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:42,914 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-23 21:37:42,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-23 21:37:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-23 21:37:42,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-23 21:37:42,916 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:42,916 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1] [2018-09-23 21:37:42,916 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:42,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1194294225, now seen corresponding path program 17 times [2018-09-23 21:37:42,916 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:42,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:42,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:43,394 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-23 21:37:43,395 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:43,395 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:37:43,403 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:37:43,441 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-09-23 21:37:43,441 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:43,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:43,446 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-23 21:37:43,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:43,455 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-23 21:37:43,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:43,820 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-23 21:37:43,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:43,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 36 [2018-09-23 21:37:43,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-23 21:37:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-23 21:37:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 21:37:43,841 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 38 states. [2018-09-23 21:37:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:43,944 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-23 21:37:43,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-23 21:37:43,944 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-09-23 21:37:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:43,945 INFO L225 Difference]: With dead ends: 79 [2018-09-23 21:37:43,945 INFO L226 Difference]: Without dead ends: 78 [2018-09-23 21:37:43,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-09-23 21:37:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-23 21:37:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-23 21:37:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-23 21:37:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-23 21:37:43,952 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 72 [2018-09-23 21:37:43,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:43,952 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-23 21:37:43,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-23 21:37:43,952 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-23 21:37:43,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-23 21:37:43,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:43,953 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1] [2018-09-23 21:37:43,953 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:43,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:43,954 INFO L82 PathProgramCache]: Analyzing trace with hash 395896040, now seen corresponding path program 18 times [2018-09-23 21:37:43,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:43,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:43,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:43,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:43,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:44,587 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-23 21:37:44,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:44,587 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-23 21:37:44,595 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:37:44,636 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-09-23 21:37:44,636 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:44,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:44,652 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-23 21:37:44,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:44,660 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-23 21:37:44,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:45,233 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-23 21:37:45,254 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:45,254 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 38 [2018-09-23 21:37:45,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-23 21:37:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-23 21:37:45,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 21:37:45,256 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 40 states. [2018-09-23 21:37:45,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:45,365 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-23 21:37:45,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-23 21:37:45,365 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-09-23 21:37:45,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:45,366 INFO L225 Difference]: With dead ends: 83 [2018-09-23 21:37:45,367 INFO L226 Difference]: Without dead ends: 82 [2018-09-23 21:37:45,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-23 21:37:45,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-23 21:37:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-09-23 21:37:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-23 21:37:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-23 21:37:45,371 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 76 [2018-09-23 21:37:45,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:45,371 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-23 21:37:45,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-23 21:37:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-23 21:37:45,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-23 21:37:45,372 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:45,372 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1] [2018-09-23 21:37:45,372 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:45,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash 627065121, now seen corresponding path program 19 times [2018-09-23 21:37:45,373 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:45,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:45,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:45,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:45,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:45,715 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-23 21:37:45,715 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:45,715 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-23 21:37:45,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:45,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:45,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-23 21:37:45,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:45,803 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-23 21:37:45,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:46,618 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-23 21:37:46,639 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:46,639 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 40 [2018-09-23 21:37:46,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-23 21:37:46,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-23 21:37:46,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 21:37:46,640 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 42 states. [2018-09-23 21:37:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:46,793 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-23 21:37:46,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-23 21:37:46,793 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-23 21:37:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:46,794 INFO L225 Difference]: With dead ends: 87 [2018-09-23 21:37:46,794 INFO L226 Difference]: Without dead ends: 86 [2018-09-23 21:37:46,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-09-23 21:37:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-23 21:37:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-09-23 21:37:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-23 21:37:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-23 21:37:46,800 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 80 [2018-09-23 21:37:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:46,801 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-23 21:37:46,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-23 21:37:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-23 21:37:46,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-23 21:37:46,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:46,802 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1] [2018-09-23 21:37:46,802 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:46,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:46,803 INFO L82 PathProgramCache]: Analyzing trace with hash 188537050, now seen corresponding path program 20 times [2018-09-23 21:37:46,803 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:46,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:46,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:46,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:46,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:47,495 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-23 21:37:47,496 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:47,496 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-23 21:37:47,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:37:47,531 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:37:47,531 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:47,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:47,559 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-23 21:37:47,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:47,599 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-23 21:37:47,599 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:48,197 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-23 21:37:48,218 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:48,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 42 [2018-09-23 21:37:48,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-23 21:37:48,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-23 21:37:48,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-09-23 21:37:48,219 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 44 states. [2018-09-23 21:37:48,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:48,384 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-23 21:37:48,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-23 21:37:48,385 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-09-23 21:37:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:48,386 INFO L225 Difference]: With dead ends: 91 [2018-09-23 21:37:48,386 INFO L226 Difference]: Without dead ends: 90 [2018-09-23 21:37:48,388 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-23 21:37:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-23 21:37:48,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-23 21:37:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-23 21:37:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-23 21:37:48,391 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 84 [2018-09-23 21:37:48,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:48,391 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-23 21:37:48,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-23 21:37:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-23 21:37:48,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-23 21:37:48,392 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:48,392 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1] [2018-09-23 21:37:48,392 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:48,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:48,393 INFO L82 PathProgramCache]: Analyzing trace with hash -47911917, now seen corresponding path program 21 times [2018-09-23 21:37:48,393 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:48,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:48,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:48,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:48,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:49,336 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-23 21:37:49,336 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:49,336 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-23 21:37:49,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:37:49,406 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-09-23 21:37:49,406 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:49,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:49,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 21:37:49,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:49,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:37:49,430 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:50,922 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-23 21:37:50,942 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:50,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 44 [2018-09-23 21:37:50,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-23 21:37:50,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-23 21:37:50,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 21:37:50,944 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 46 states. [2018-09-23 21:37:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:51,096 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-23 21:37:51,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-23 21:37:51,104 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-09-23 21:37:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:51,104 INFO L225 Difference]: With dead ends: 95 [2018-09-23 21:37:51,105 INFO L226 Difference]: Without dead ends: 94 [2018-09-23 21:37:51,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-09-23 21:37:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-23 21:37:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-09-23 21:37:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-23 21:37:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-23 21:37:51,109 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 88 [2018-09-23 21:37:51,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:51,109 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-23 21:37:51,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-23 21:37:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-23 21:37:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-23 21:37:51,110 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:51,110 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1] [2018-09-23 21:37:51,110 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:51,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:51,111 INFO L82 PathProgramCache]: Analyzing trace with hash -907101492, now seen corresponding path program 22 times [2018-09-23 21:37:51,111 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:51,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:51,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:51,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:51,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:51,484 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-23 21:37:51,484 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:51,484 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:37:51,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:37:51,526 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:37:51,526 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:51,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:51,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 21:37:51,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:51,541 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-23 21:37:51,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:51,971 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-23 21:37:51,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:51,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 46 [2018-09-23 21:37:51,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-23 21:37:51,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-23 21:37:51,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-23 21:37:51,993 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 48 states. [2018-09-23 21:37:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:52,149 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-23 21:37:52,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-23 21:37:52,150 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 92 [2018-09-23 21:37:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:52,151 INFO L225 Difference]: With dead ends: 99 [2018-09-23 21:37:52,151 INFO L226 Difference]: Without dead ends: 98 [2018-09-23 21:37:52,152 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-23 21:37:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-23 21:37:52,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-09-23 21:37:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-23 21:37:52,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-23 21:37:52,157 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 92 [2018-09-23 21:37:52,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:52,157 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-23 21:37:52,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-23 21:37:52,157 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-23 21:37:52,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-23 21:37:52,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:52,158 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1] [2018-09-23 21:37:52,158 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:52,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:52,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1800439045, now seen corresponding path program 23 times [2018-09-23 21:37:52,159 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:52,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:52,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:52,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:52,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:52,577 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-23 21:37:52,577 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:52,577 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:37:52,585 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:37:52,635 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-09-23 21:37:52,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:52,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:52,658 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-23 21:37:52,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:52,732 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-23 21:37:52,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:53,441 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-23 21:37:53,461 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:53,461 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 48 [2018-09-23 21:37:53,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-23 21:37:53,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-23 21:37:53,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 21:37:53,463 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 50 states. [2018-09-23 21:37:53,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:53,702 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-23 21:37:53,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-23 21:37:53,702 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-23 21:37:53,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:53,703 INFO L225 Difference]: With dead ends: 103 [2018-09-23 21:37:53,707 INFO L226 Difference]: Without dead ends: 102 [2018-09-23 21:37:53,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-09-23 21:37:53,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-23 21:37:53,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-23 21:37:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-23 21:37:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-23 21:37:53,711 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 96 [2018-09-23 21:37:53,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:53,711 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-23 21:37:53,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-23 21:37:53,711 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-23 21:37:53,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-23 21:37:53,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:53,712 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1] [2018-09-23 21:37:53,712 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:53,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:53,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1780446530, now seen corresponding path program 24 times [2018-09-23 21:37:53,713 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:53,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:53,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:53,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:54,386 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-23 21:37:54,386 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:54,386 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-23 21:37:54,394 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:37:54,471 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-09-23 21:37:54,471 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:54,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:54,481 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-23 21:37:54,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:54,493 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-23 21:37:54,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:54,953 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-23 21:37:54,973 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:54,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 50 [2018-09-23 21:37:54,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-23 21:37:54,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-23 21:37:54,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 21:37:54,975 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 52 states. [2018-09-23 21:37:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:55,182 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-23 21:37:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-23 21:37:55,183 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-09-23 21:37:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:55,184 INFO L225 Difference]: With dead ends: 107 [2018-09-23 21:37:55,184 INFO L226 Difference]: Without dead ends: 106 [2018-09-23 21:37:55,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-09-23 21:37:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-23 21:37:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-09-23 21:37:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-23 21:37:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-23 21:37:55,189 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 100 [2018-09-23 21:37:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:55,190 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-23 21:37:55,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-23 21:37:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-23 21:37:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-23 21:37:55,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:55,191 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1] [2018-09-23 21:37:55,191 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:55,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:55,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1226116087, now seen corresponding path program 25 times [2018-09-23 21:37:55,191 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:55,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:55,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:55,720 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-23 21:37:55,720 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:55,720 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:37:55,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:55,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:55,762 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-23 21:37:55,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:55,773 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-23 21:37:55,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:56,473 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-23 21:37:56,494 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:56,494 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2018-09-23 21:37:56,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-23 21:37:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-23 21:37:56,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 21:37:56,496 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 54 states. [2018-09-23 21:37:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:56,681 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-23 21:37:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-23 21:37:56,681 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 104 [2018-09-23 21:37:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:56,683 INFO L225 Difference]: With dead ends: 111 [2018-09-23 21:37:56,683 INFO L226 Difference]: Without dead ends: 110 [2018-09-23 21:37:56,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-09-23 21:37:56,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-23 21:37:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-09-23 21:37:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-23 21:37:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-23 21:37:56,688 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 104 [2018-09-23 21:37:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:56,688 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-23 21:37:56,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-23 21:37:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-23 21:37:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-23 21:37:56,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:56,689 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1] [2018-09-23 21:37:56,689 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:56,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:56,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1598310576, now seen corresponding path program 26 times [2018-09-23 21:37:56,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:56,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:56,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:37:56,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:57,212 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-23 21:37:57,213 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:57,213 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:37:57,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:37:57,250 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:37:57,250 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:57,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:57,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-23 21:37:57,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:57,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-23 21:37:57,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:57,787 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-23 21:37:57,810 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:57,810 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 54 [2018-09-23 21:37:57,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-23 21:37:57,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-23 21:37:57,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 21:37:57,812 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 56 states. [2018-09-23 21:37:57,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:57,990 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-23 21:37:57,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-23 21:37:57,991 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-09-23 21:37:57,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:57,992 INFO L225 Difference]: With dead ends: 115 [2018-09-23 21:37:57,992 INFO L226 Difference]: Without dead ends: 114 [2018-09-23 21:37:57,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-23 21:37:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-23 21:37:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-23 21:37:57,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-23 21:37:57,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-23 21:37:57,998 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 108 [2018-09-23 21:37:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:57,998 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-23 21:37:57,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-23 21:37:57,998 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-23 21:37:57,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-23 21:37:57,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:57,999 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1] [2018-09-23 21:37:57,999 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:57,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:58,000 INFO L82 PathProgramCache]: Analyzing trace with hash 497320169, now seen corresponding path program 27 times [2018-09-23 21:37:58,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:58,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:58,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:58,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:58,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:37:58,712 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-23 21:37:58,712 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:37:58,712 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-23 21:37:58,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:37:58,825 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-09-23 21:37:58,825 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:37:58,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:37:58,845 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-23 21:37:58,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:37:58,882 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-23 21:37:58,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:37:59,482 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-23 21:37:59,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:37:59,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2018-09-23 21:37:59,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-23 21:37:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-23 21:37:59,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 21:37:59,504 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 58 states. [2018-09-23 21:37:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:37:59,700 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-23 21:37:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-23 21:37:59,700 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-23 21:37:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:37:59,701 INFO L225 Difference]: With dead ends: 119 [2018-09-23 21:37:59,701 INFO L226 Difference]: Without dead ends: 118 [2018-09-23 21:37:59,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-09-23 21:37:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-23 21:37:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-09-23 21:37:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-23 21:37:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-23 21:37:59,707 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 112 [2018-09-23 21:37:59,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:37:59,707 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-23 21:37:59,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-23 21:37:59,707 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-23 21:37:59,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-23 21:37:59,708 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:37:59,708 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1] [2018-09-23 21:37:59,708 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:37:59,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:37:59,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1001655134, now seen corresponding path program 28 times [2018-09-23 21:37:59,708 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:37:59,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:37:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:59,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:37:59,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:37:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:00,311 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-23 21:38:00,311 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:00,312 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-23 21:38:00,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:38:00,353 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:38:00,354 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:00,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:00,379 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-23 21:38:00,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:00,475 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-23 21:38:00,475 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:01,092 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-23 21:38:01,112 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:01,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 58 [2018-09-23 21:38:01,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-23 21:38:01,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-23 21:38:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-23 21:38:01,114 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 60 states. [2018-09-23 21:38:01,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:01,289 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-23 21:38:01,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-23 21:38:01,289 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 116 [2018-09-23 21:38:01,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:01,291 INFO L225 Difference]: With dead ends: 123 [2018-09-23 21:38:01,291 INFO L226 Difference]: Without dead ends: 122 [2018-09-23 21:38:01,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1624 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-09-23 21:38:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-23 21:38:01,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-09-23 21:38:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-23 21:38:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-23 21:38:01,297 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 116 [2018-09-23 21:38:01,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:01,297 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-23 21:38:01,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-23 21:38:01,298 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-23 21:38:01,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-23 21:38:01,298 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:01,298 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1] [2018-09-23 21:38:01,299 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:01,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:01,299 INFO L82 PathProgramCache]: Analyzing trace with hash 506520539, now seen corresponding path program 29 times [2018-09-23 21:38:01,299 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:01,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:01,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:01,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:01,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:01,871 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-23 21:38:01,871 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:01,871 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-23 21:38:01,881 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:38:01,956 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-09-23 21:38:01,956 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:01,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:01,962 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-23 21:38:01,963 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:01,971 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-23 21:38:01,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:02,610 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-23 21:38:02,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:02,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 60 [2018-09-23 21:38:02,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-23 21:38:02,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-23 21:38:02,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 21:38:02,632 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 62 states. [2018-09-23 21:38:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:02,884 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-23 21:38:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-23 21:38:02,885 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-09-23 21:38:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:02,886 INFO L225 Difference]: With dead ends: 127 [2018-09-23 21:38:02,886 INFO L226 Difference]: Without dead ends: 126 [2018-09-23 21:38:02,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-09-23 21:38:02,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-23 21:38:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-23 21:38:02,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-23 21:38:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-23 21:38:02,892 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 120 [2018-09-23 21:38:02,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:02,892 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-23 21:38:02,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-23 21:38:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-23 21:38:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-23 21:38:02,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:02,893 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1] [2018-09-23 21:38:02,893 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:02,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash 287936148, now seen corresponding path program 30 times [2018-09-23 21:38:02,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:02,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:02,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:02,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:02,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:04,034 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-23 21:38:04,035 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:04,035 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-23 21:38:04,059 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:38:04,144 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-09-23 21:38:04,144 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:04,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:04,161 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-23 21:38:04,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:04,175 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-23 21:38:04,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:04,821 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-23 21:38:04,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:04,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 62 [2018-09-23 21:38:04,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-23 21:38:04,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-23 21:38:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 21:38:04,842 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 64 states. [2018-09-23 21:38:05,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:05,040 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-23 21:38:05,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-23 21:38:05,040 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-09-23 21:38:05,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:05,041 INFO L225 Difference]: With dead ends: 131 [2018-09-23 21:38:05,042 INFO L226 Difference]: Without dead ends: 130 [2018-09-23 21:38:05,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1860 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-09-23 21:38:05,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-23 21:38:05,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-09-23 21:38:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-23 21:38:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-23 21:38:05,047 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 124 [2018-09-23 21:38:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:05,047 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-23 21:38:05,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-23 21:38:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-23 21:38:05,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-23 21:38:05,048 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:05,048 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1] [2018-09-23 21:38:05,048 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:05,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:05,048 INFO L82 PathProgramCache]: Analyzing trace with hash 770454733, now seen corresponding path program 31 times [2018-09-23 21:38:05,048 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:05,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:05,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:05,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:05,880 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-23 21:38:05,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:05,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 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-23 21:38:05,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:38:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:05,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:05,930 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-23 21:38:05,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:05,943 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-23 21:38:05,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:06,840 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-23 21:38:06,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:06,861 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 64 [2018-09-23 21:38:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-23 21:38:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-23 21:38:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 21:38:06,862 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 66 states. [2018-09-23 21:38:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:07,067 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-23 21:38:07,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-23 21:38:07,068 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-09-23 21:38:07,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:07,070 INFO L225 Difference]: With dead ends: 135 [2018-09-23 21:38:07,070 INFO L226 Difference]: Without dead ends: 134 [2018-09-23 21:38:07,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-23 21:38:07,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-23 21:38:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-09-23 21:38:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-23 21:38:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-23 21:38:07,075 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 128 [2018-09-23 21:38:07,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:07,076 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-23 21:38:07,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-23 21:38:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-23 21:38:07,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-23 21:38:07,077 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:07,077 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1] [2018-09-23 21:38:07,077 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:07,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1074730630, now seen corresponding path program 32 times [2018-09-23 21:38:07,078 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:07,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:07,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:07,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:38:07,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:07,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:07,761 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-23 21:38:07,761 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:07,761 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-23 21:38:07,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:38:07,823 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:38:07,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:07,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:07,846 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-23 21:38:07,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:07,862 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-23 21:38:07,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:09,010 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-23 21:38:09,030 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:09,030 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 66 [2018-09-23 21:38:09,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-23 21:38:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-23 21:38:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-09-23 21:38:09,032 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 68 states. [2018-09-23 21:38:09,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:09,287 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-23 21:38:09,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-23 21:38:09,288 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-23 21:38:09,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:09,290 INFO L225 Difference]: With dead ends: 139 [2018-09-23 21:38:09,290 INFO L226 Difference]: Without dead ends: 138 [2018-09-23 21:38:09,291 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-23 21:38:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-23 21:38:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-23 21:38:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-23 21:38:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-23 21:38:09,296 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 132 [2018-09-23 21:38:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:09,296 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-23 21:38:09,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-23 21:38:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-23 21:38:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-23 21:38:09,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:09,297 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1] [2018-09-23 21:38:09,297 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:09,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -569871425, now seen corresponding path program 33 times [2018-09-23 21:38:09,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:09,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:09,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:09,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:09,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:10,109 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-23 21:38:10,109 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:10,109 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:38:10,116 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:38:10,286 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-09-23 21:38:10,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:10,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:10,306 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-23 21:38:10,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:10,405 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-23 21:38:10,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:12,161 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-23 21:38:12,183 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:12,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 68 [2018-09-23 21:38:12,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-23 21:38:12,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-23 21:38:12,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 21:38:12,185 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 70 states. [2018-09-23 21:38:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:12,524 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-23 21:38:12,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-23 21:38:12,525 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-09-23 21:38:12,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:12,526 INFO L225 Difference]: With dead ends: 143 [2018-09-23 21:38:12,526 INFO L226 Difference]: Without dead ends: 142 [2018-09-23 21:38:12,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-09-23 21:38:12,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-23 21:38:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-09-23 21:38:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-23 21:38:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-23 21:38:12,531 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 136 [2018-09-23 21:38:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:12,532 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-23 21:38:12,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-23 21:38:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-23 21:38:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-23 21:38:12,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:12,533 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1] [2018-09-23 21:38:12,533 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:12,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:12,534 INFO L82 PathProgramCache]: Analyzing trace with hash -114389896, now seen corresponding path program 34 times [2018-09-23 21:38:12,534 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:12,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:12,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:12,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:12,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:13,290 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-23 21:38:13,291 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:13,291 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-23 21:38:13,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:38:13,335 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:38:13,335 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:13,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:13,342 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-23 21:38:13,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:13,354 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-23 21:38:13,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:14,457 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-23 21:38:14,478 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:14,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 70 [2018-09-23 21:38:14,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-23 21:38:14,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-23 21:38:14,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 21:38:14,480 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 72 states. [2018-09-23 21:38:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:14,864 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-23 21:38:14,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-23 21:38:14,864 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 140 [2018-09-23 21:38:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:14,866 INFO L225 Difference]: With dead ends: 147 [2018-09-23 21:38:14,866 INFO L226 Difference]: Without dead ends: 146 [2018-09-23 21:38:14,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2380 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-23 21:38:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-23 21:38:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-09-23 21:38:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-23 21:38:14,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-23 21:38:14,872 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 140 [2018-09-23 21:38:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:14,872 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-23 21:38:14,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-23 21:38:14,873 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-23 21:38:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-23 21:38:14,873 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:14,874 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1] [2018-09-23 21:38:14,874 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:14,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1840750769, now seen corresponding path program 35 times [2018-09-23 21:38:14,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:14,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:14,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:14,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:14,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:15,832 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-23 21:38:15,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:15,832 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-23 21:38:15,840 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:38:15,936 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-09-23 21:38:15,936 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:15,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:15,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 21:38:15,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:15,952 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-23 21:38:15,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:16,819 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-23 21:38:16,839 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:16,839 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 72 [2018-09-23 21:38:16,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-23 21:38:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-23 21:38:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 21:38:16,841 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 74 states. [2018-09-23 21:38:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:17,300 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-23 21:38:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-23 21:38:17,301 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-09-23 21:38:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:17,303 INFO L225 Difference]: With dead ends: 151 [2018-09-23 21:38:17,303 INFO L226 Difference]: Without dead ends: 150 [2018-09-23 21:38:17,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-09-23 21:38:17,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-23 21:38:17,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-23 21:38:17,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-23 21:38:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-23 21:38:17,309 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 144 [2018-09-23 21:38:17,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:17,309 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-23 21:38:17,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-23 21:38:17,309 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-23 21:38:17,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-23 21:38:17,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:17,310 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 1, 1] [2018-09-23 21:38:17,310 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:17,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:17,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1833308054, now seen corresponding path program 36 times [2018-09-23 21:38:17,311 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:17,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:17,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:17,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:17,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:18,152 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-23 21:38:18,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:18,153 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-23 21:38:18,160 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:38:18,269 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-09-23 21:38:18,269 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:18,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:18,289 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-23 21:38:18,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:18,299 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-23 21:38:18,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:19,426 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-23 21:38:19,447 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:19,447 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 74 [2018-09-23 21:38:19,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-23 21:38:19,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-23 21:38:19,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-23 21:38:19,449 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 76 states. [2018-09-23 21:38:19,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:19,729 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-23 21:38:19,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-23 21:38:19,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-09-23 21:38:19,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:19,732 INFO L225 Difference]: With dead ends: 155 [2018-09-23 21:38:19,732 INFO L226 Difference]: Without dead ends: 154 [2018-09-23 21:38:19,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2664 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-09-23 21:38:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-23 21:38:19,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-09-23 21:38:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-23 21:38:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-23 21:38:19,738 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 148 [2018-09-23 21:38:19,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:19,738 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-23 21:38:19,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-23 21:38:19,739 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-23 21:38:19,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-23 21:38:19,739 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:19,740 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1] [2018-09-23 21:38:19,740 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:19,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:19,740 INFO L82 PathProgramCache]: Analyzing trace with hash -903103581, now seen corresponding path program 37 times [2018-09-23 21:38:19,740 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:19,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:19,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:19,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:19,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:20,700 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-23 21:38:20,701 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:20,701 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-23 21:38:20,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:38:20,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:20,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:20,773 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-23 21:38:20,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:20,785 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-23 21:38:20,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:22,253 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-23 21:38:22,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:22,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 76 [2018-09-23 21:38:22,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-23 21:38:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-23 21:38:22,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 21:38:22,274 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 78 states. [2018-09-23 21:38:22,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:22,540 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-23 21:38:22,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-23 21:38:22,541 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 152 [2018-09-23 21:38:22,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:22,542 INFO L225 Difference]: With dead ends: 159 [2018-09-23 21:38:22,542 INFO L226 Difference]: Without dead ends: 158 [2018-09-23 21:38:22,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-09-23 21:38:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-23 21:38:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-09-23 21:38:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-23 21:38:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-23 21:38:22,547 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 152 [2018-09-23 21:38:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:22,547 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-23 21:38:22,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-23 21:38:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-23 21:38:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-23 21:38:22,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:22,548 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 1, 1] [2018-09-23 21:38:22,548 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:22,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:22,549 INFO L82 PathProgramCache]: Analyzing trace with hash 283329116, now seen corresponding path program 38 times [2018-09-23 21:38:22,549 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:22,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:22,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:22,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:38:22,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:24,021 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-23 21:38:24,021 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:24,022 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-23 21:38:24,029 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:38:24,071 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:38:24,071 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:24,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:24,078 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-23 21:38:24,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:24,089 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-23 21:38:24,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:25,117 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-23 21:38:25,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:25,138 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 78 [2018-09-23 21:38:25,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-23 21:38:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-23 21:38:25,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 21:38:25,139 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 80 states. [2018-09-23 21:38:25,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:25,419 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-23 21:38:25,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-23 21:38:25,420 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-09-23 21:38:25,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:25,421 INFO L225 Difference]: With dead ends: 163 [2018-09-23 21:38:25,422 INFO L226 Difference]: Without dead ends: 162 [2018-09-23 21:38:25,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2964 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-09-23 21:38:25,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-23 21:38:25,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-23 21:38:25,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-23 21:38:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-23 21:38:25,428 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 156 [2018-09-23 21:38:25,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:25,428 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-23 21:38:25,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-23 21:38:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-23 21:38:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-23 21:38:25,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:25,430 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1] [2018-09-23 21:38:25,430 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:25,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1902721899, now seen corresponding path program 39 times [2018-09-23 21:38:25,430 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:25,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:25,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:25,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:26,850 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-23 21:38:26,850 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:26,850 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:38:26,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:38:27,363 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-09-23 21:38:27,364 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:27,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:27,371 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-23 21:38:27,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:27,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-23 21:38:27,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:28,498 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-23 21:38:28,519 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:28,519 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 80 [2018-09-23 21:38:28,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-23 21:38:28,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-23 21:38:28,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 21:38:28,521 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 82 states. [2018-09-23 21:38:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:28,806 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-23 21:38:28,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-23 21:38:28,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-09-23 21:38:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:28,807 INFO L225 Difference]: With dead ends: 167 [2018-09-23 21:38:28,808 INFO L226 Difference]: Without dead ends: 166 [2018-09-23 21:38:28,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-09-23 21:38:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-23 21:38:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-09-23 21:38:28,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-23 21:38:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-23 21:38:28,813 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 160 [2018-09-23 21:38:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:28,813 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-23 21:38:28,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-23 21:38:28,813 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-23 21:38:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-23 21:38:28,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:28,814 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 1, 1] [2018-09-23 21:38:28,815 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:28,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:28,815 INFO L82 PathProgramCache]: Analyzing trace with hash 635208270, now seen corresponding path program 40 times [2018-09-23 21:38:28,815 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:28,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:28,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:28,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:28,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:30,394 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-23 21:38:30,394 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:30,394 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:38:30,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:38:30,452 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:38:30,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:30,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:30,475 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-23 21:38:30,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:30,529 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-23 21:38:30,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:31,663 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-23 21:38:31,683 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:31,683 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 82 [2018-09-23 21:38:31,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-23 21:38:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-23 21:38:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 21:38:31,685 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 84 states. [2018-09-23 21:38:32,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:32,221 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-23 21:38:32,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-23 21:38:32,222 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 164 [2018-09-23 21:38:32,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:32,223 INFO L225 Difference]: With dead ends: 171 [2018-09-23 21:38:32,223 INFO L226 Difference]: Without dead ends: 170 [2018-09-23 21:38:32,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3280 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-09-23 21:38:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-23 21:38:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-09-23 21:38:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-23 21:38:32,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-23 21:38:32,231 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 164 [2018-09-23 21:38:32,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:32,232 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-23 21:38:32,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-23 21:38:32,232 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-23 21:38:32,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-23 21:38:32,233 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:32,233 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1] [2018-09-23 21:38:32,233 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:32,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:32,233 INFO L82 PathProgramCache]: Analyzing trace with hash 69909383, now seen corresponding path program 41 times [2018-09-23 21:38:32,233 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:32,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:32,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:32,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:33,290 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-23 21:38:33,290 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:33,291 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-23 21:38:33,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:38:33,478 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-09-23 21:38:33,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:33,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:33,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 21:38:33,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:33,588 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-23 21:38:33,589 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:35,103 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-23 21:38:35,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:35,124 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 84 [2018-09-23 21:38:35,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-23 21:38:35,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-23 21:38:35,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 21:38:35,126 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 86 states. [2018-09-23 21:38:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:35,440 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-23 21:38:35,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-23 21:38:35,440 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-09-23 21:38:35,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:35,442 INFO L225 Difference]: With dead ends: 175 [2018-09-23 21:38:35,442 INFO L226 Difference]: Without dead ends: 174 [2018-09-23 21:38:35,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-09-23 21:38:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-23 21:38:35,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-23 21:38:35,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-23 21:38:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-23 21:38:35,448 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 168 [2018-09-23 21:38:35,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:35,449 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-23 21:38:35,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-23 21:38:35,449 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-23 21:38:35,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-23 21:38:35,450 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:35,450 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 1, 1] [2018-09-23 21:38:35,450 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:35,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:35,451 INFO L82 PathProgramCache]: Analyzing trace with hash 836218944, now seen corresponding path program 42 times [2018-09-23 21:38:35,451 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:35,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:35,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:35,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:37,153 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-23 21:38:37,153 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:37,153 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-23 21:38:37,168 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:38:37,349 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-09-23 21:38:37,349 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:37,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:37,360 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-23 21:38:37,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:37,368 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-23 21:38:37,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:38,594 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-23 21:38:38,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:38,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 86 [2018-09-23 21:38:38,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-23 21:38:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-23 21:38:38,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-23 21:38:38,617 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 88 states. [2018-09-23 21:38:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:39,309 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-23 21:38:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-23 21:38:39,309 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-09-23 21:38:39,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:39,310 INFO L225 Difference]: With dead ends: 179 [2018-09-23 21:38:39,310 INFO L226 Difference]: Without dead ends: 178 [2018-09-23 21:38:39,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3612 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-09-23 21:38:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-23 21:38:39,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-09-23 21:38:39,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-23 21:38:39,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-23 21:38:39,316 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 172 [2018-09-23 21:38:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:39,316 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-23 21:38:39,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-23 21:38:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-23 21:38:39,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-23 21:38:39,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:39,318 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1] [2018-09-23 21:38:39,318 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:39,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:39,318 INFO L82 PathProgramCache]: Analyzing trace with hash 572104825, now seen corresponding path program 43 times [2018-09-23 21:38:39,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:39,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:39,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:39,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:41,060 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-23 21:38:41,060 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:41,060 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-23 21:38:41,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:38:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:41,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:41,124 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-23 21:38:41,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:41,134 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-23 21:38:41,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:42,363 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-23 21:38:42,383 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:42,383 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 88 [2018-09-23 21:38:42,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-23 21:38:42,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-23 21:38:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-23 21:38:42,385 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 90 states. [2018-09-23 21:38:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:42,662 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-23 21:38:42,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-23 21:38:42,662 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 176 [2018-09-23 21:38:42,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:42,663 INFO L225 Difference]: With dead ends: 183 [2018-09-23 21:38:42,664 INFO L226 Difference]: Without dead ends: 182 [2018-09-23 21:38:42,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-09-23 21:38:42,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-23 21:38:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-09-23 21:38:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-23 21:38:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-23 21:38:42,669 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 176 [2018-09-23 21:38:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:42,670 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-23 21:38:42,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-23 21:38:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-23 21:38:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-23 21:38:42,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:42,671 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 1, 1] [2018-09-23 21:38:42,671 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:42,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1124518962, now seen corresponding path program 44 times [2018-09-23 21:38:42,672 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:42,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:38:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:44,073 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-23 21:38:44,073 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:44,073 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-23 21:38:44,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:38:44,131 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:38:44,131 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:44,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:44,137 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-23 21:38:44,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:44,146 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-23 21:38:44,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:45,671 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-23 21:38:45,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:45,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 90 [2018-09-23 21:38:45,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-23 21:38:45,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-23 21:38:45,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 21:38:45,693 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 92 states. [2018-09-23 21:38:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:45,994 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-23 21:38:45,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-23 21:38:45,994 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-09-23 21:38:45,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:45,996 INFO L225 Difference]: With dead ends: 187 [2018-09-23 21:38:45,996 INFO L226 Difference]: Without dead ends: 186 [2018-09-23 21:38:45,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-09-23 21:38:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-23 21:38:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-23 21:38:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-23 21:38:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-23 21:38:46,002 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 180 [2018-09-23 21:38:46,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:46,002 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-23 21:38:46,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-23 21:38:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-23 21:38:46,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-23 21:38:46,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:46,004 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1] [2018-09-23 21:38:46,004 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:46,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:46,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1919585429, now seen corresponding path program 45 times [2018-09-23 21:38:46,004 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:46,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:46,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:46,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:47,176 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-23 21:38:47,177 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:47,177 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-23 21:38:47,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:38:47,350 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-09-23 21:38:47,350 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:47,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:47,358 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-23 21:38:47,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:47,371 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-23 21:38:47,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:48,739 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-23 21:38:48,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:48,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 92 [2018-09-23 21:38:48,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-23 21:38:48,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-23 21:38:48,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 21:38:48,761 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 94 states. [2018-09-23 21:38:49,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:49,064 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-23 21:38:49,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-23 21:38:49,065 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 184 [2018-09-23 21:38:49,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:49,066 INFO L225 Difference]: With dead ends: 191 [2018-09-23 21:38:49,067 INFO L226 Difference]: Without dead ends: 190 [2018-09-23 21:38:49,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-09-23 21:38:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-23 21:38:49,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-09-23 21:38:49,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-23 21:38:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-23 21:38:49,073 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 184 [2018-09-23 21:38:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:49,073 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-23 21:38:49,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-23 21:38:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-23 21:38:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-23 21:38:49,074 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:49,074 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 1, 1] [2018-09-23 21:38:49,074 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:49,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 362534436, now seen corresponding path program 46 times [2018-09-23 21:38:49,074 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:49,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:49,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:49,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:50,516 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-23 21:38:50,516 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:50,517 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-23 21:38:50,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:38:50,577 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:38:50,578 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:50,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:50,599 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-23 21:38:50,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:50,695 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-23 21:38:50,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:53,376 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-23 21:38:53,396 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:53,396 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 94 [2018-09-23 21:38:53,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-23 21:38:53,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-23 21:38:53,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 21:38:53,398 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 96 states. [2018-09-23 21:38:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:53,865 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-23 21:38:53,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-23 21:38:53,866 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 188 [2018-09-23 21:38:53,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:53,867 INFO L225 Difference]: With dead ends: 195 [2018-09-23 21:38:53,867 INFO L226 Difference]: Without dead ends: 194 [2018-09-23 21:38:53,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4324 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-09-23 21:38:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-23 21:38:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-09-23 21:38:53,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-23 21:38:53,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-23 21:38:53,873 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 188 [2018-09-23 21:38:53,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:53,873 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-23 21:38:53,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-23 21:38:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-23 21:38:53,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-23 21:38:53,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:53,875 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1] [2018-09-23 21:38:53,875 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:53,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1714408355, now seen corresponding path program 47 times [2018-09-23 21:38:53,875 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:53,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:53,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:53,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:53,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:55,548 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-23 21:38:55,548 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:55,548 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-23 21:38:55,556 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:38:55,681 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-09-23 21:38:55,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:55,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:55,709 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-23 21:38:55,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:55,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-23 21:38:55,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:38:57,297 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-23 21:38:57,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:38:57,318 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 96 [2018-09-23 21:38:57,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-23 21:38:57,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-23 21:38:57,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 21:38:57,320 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 98 states. [2018-09-23 21:38:57,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:38:57,877 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-23 21:38:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-23 21:38:57,877 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 192 [2018-09-23 21:38:57,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:38:57,879 INFO L225 Difference]: With dead ends: 199 [2018-09-23 21:38:57,879 INFO L226 Difference]: Without dead ends: 198 [2018-09-23 21:38:57,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-09-23 21:38:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-23 21:38:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-23 21:38:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-23 21:38:57,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-23 21:38:57,885 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 192 [2018-09-23 21:38:57,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:38:57,885 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-23 21:38:57,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-23 21:38:57,886 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-23 21:38:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-23 21:38:57,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:38:57,886 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 1, 1] [2018-09-23 21:38:57,887 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:38:57,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:38:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash 331927062, now seen corresponding path program 48 times [2018-09-23 21:38:57,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:38:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:38:57,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:57,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:38:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:38:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:38:59,300 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-23 21:38:59,300 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:38:59,300 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-23 21:38:59,307 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:38:59,463 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-09-23 21:38:59,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:38:59,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:38:59,470 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-23 21:38:59,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:38:59,490 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-23 21:38:59,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:01,157 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-23 21:39:01,178 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:01,178 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 98 [2018-09-23 21:39:01,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-23 21:39:01,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-23 21:39:01,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 21:39:01,180 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 100 states. [2018-09-23 21:39:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:01,536 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-23 21:39:01,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-23 21:39:01,537 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 196 [2018-09-23 21:39:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:01,538 INFO L225 Difference]: With dead ends: 203 [2018-09-23 21:39:01,539 INFO L226 Difference]: Without dead ends: 202 [2018-09-23 21:39:01,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-09-23 21:39:01,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-23 21:39:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-09-23 21:39:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-23 21:39:01,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-23 21:39:01,636 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 196 [2018-09-23 21:39:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:01,636 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-23 21:39:01,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-23 21:39:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-23 21:39:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-23 21:39:01,638 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:01,638 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1] [2018-09-23 21:39:01,638 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:01,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1207690063, now seen corresponding path program 49 times [2018-09-23 21:39:01,638 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:01,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:01,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:03,096 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-23 21:39:03,096 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:03,096 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:39:03,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:39:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:03,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:03,165 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-23 21:39:03,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:03,173 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-23 21:39:03,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:04,758 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-23 21:39:04,778 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:04,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 100 [2018-09-23 21:39:04,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-23 21:39:04,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-23 21:39:04,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-09-23 21:39:04,781 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 102 states. [2018-09-23 21:39:05,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:05,136 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-23 21:39:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-23 21:39:05,136 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 200 [2018-09-23 21:39:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:05,138 INFO L225 Difference]: With dead ends: 207 [2018-09-23 21:39:05,138 INFO L226 Difference]: Without dead ends: 206 [2018-09-23 21:39:05,140 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-23 21:39:05,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-23 21:39:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-09-23 21:39:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-23 21:39:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-23 21:39:05,144 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 200 [2018-09-23 21:39:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:05,144 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-23 21:39:05,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-23 21:39:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-23 21:39:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-23 21:39:05,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:05,146 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 1, 1] [2018-09-23 21:39:05,146 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:05,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:05,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1438626824, now seen corresponding path program 50 times [2018-09-23 21:39:05,147 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:05,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:05,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:05,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:39:05,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:06,498 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-23 21:39:06,498 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:06,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 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-23 21:39:06,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:39:06,558 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:39:06,559 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:06,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:06,568 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-23 21:39:06,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:06,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:39:06,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:08,487 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-23 21:39:08,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:08,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 102 [2018-09-23 21:39:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-23 21:39:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-23 21:39:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 21:39:08,511 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 104 states. [2018-09-23 21:39:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:08,816 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-23 21:39:08,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-23 21:39:08,817 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 204 [2018-09-23 21:39:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:08,819 INFO L225 Difference]: With dead ends: 211 [2018-09-23 21:39:08,819 INFO L226 Difference]: Without dead ends: 210 [2018-09-23 21:39:08,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5100 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-09-23 21:39:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-23 21:39:08,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-23 21:39:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-23 21:39:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-23 21:39:08,825 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 204 [2018-09-23 21:39:08,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:08,825 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-23 21:39:08,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-23 21:39:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-23 21:39:08,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-23 21:39:08,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:08,827 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1] [2018-09-23 21:39:08,827 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:08,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:08,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1196064833, now seen corresponding path program 51 times [2018-09-23 21:39:08,827 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:08,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:08,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:08,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:10,527 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-23 21:39:10,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:10,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 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-23 21:39:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:39:11,068 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-09-23 21:39:11,068 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:11,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:11,112 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-23 21:39:11,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:11,135 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-23 21:39:11,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:12,809 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-23 21:39:12,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:12,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 104 [2018-09-23 21:39:12,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-23 21:39:12,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-23 21:39:12,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 21:39:12,832 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 106 states. [2018-09-23 21:39:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:13,166 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-23 21:39:13,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-23 21:39:13,166 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 208 [2018-09-23 21:39:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:13,168 INFO L225 Difference]: With dead ends: 215 [2018-09-23 21:39:13,169 INFO L226 Difference]: Without dead ends: 214 [2018-09-23 21:39:13,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-09-23 21:39:13,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-23 21:39:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-09-23 21:39:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-23 21:39:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-23 21:39:13,175 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 208 [2018-09-23 21:39:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:13,176 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-23 21:39:13,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-23 21:39:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-23 21:39:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-23 21:39:13,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:13,177 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 1, 1] [2018-09-23 21:39:13,177 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:13,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1582135302, now seen corresponding path program 52 times [2018-09-23 21:39:13,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:13,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:13,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:13,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:13,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:14,595 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-23 21:39:14,596 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:14,596 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-23 21:39:14,605 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:39:14,661 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:39:14,661 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:14,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:14,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-09-23 21:39:14,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:14,698 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-23 21:39:14,698 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:16,697 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-23 21:39:16,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:16,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 106 [2018-09-23 21:39:16,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-23 21:39:16,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-23 21:39:16,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 21:39:16,720 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 108 states. [2018-09-23 21:39:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:17,073 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-23 21:39:17,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-23 21:39:17,074 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 212 [2018-09-23 21:39:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:17,075 INFO L225 Difference]: With dead ends: 219 [2018-09-23 21:39:17,075 INFO L226 Difference]: Without dead ends: 218 [2018-09-23 21:39:17,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5512 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-09-23 21:39:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-23 21:39:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-09-23 21:39:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-23 21:39:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-23 21:39:17,080 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 212 [2018-09-23 21:39:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:17,081 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-23 21:39:17,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-23 21:39:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-23 21:39:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-23 21:39:17,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:17,082 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1] [2018-09-23 21:39:17,082 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:17,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash -185726157, now seen corresponding path program 53 times [2018-09-23 21:39:17,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:17,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:17,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:18,575 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-23 21:39:18,575 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:18,575 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-23 21:39:18,582 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:39:18,721 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-09-23 21:39:18,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:18,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:18,732 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-23 21:39:18,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:18,740 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-23 21:39:18,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:20,647 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-23 21:39:20,669 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:20,669 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 108 [2018-09-23 21:39:20,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-23 21:39:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-23 21:39:20,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 21:39:20,671 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 110 states. [2018-09-23 21:39:21,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:21,032 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-23 21:39:21,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-23 21:39:21,032 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 216 [2018-09-23 21:39:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:21,034 INFO L225 Difference]: With dead ends: 223 [2018-09-23 21:39:21,034 INFO L226 Difference]: Without dead ends: 222 [2018-09-23 21:39:21,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-09-23 21:39:21,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-23 21:39:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-23 21:39:21,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-23 21:39:21,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-23 21:39:21,038 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 216 [2018-09-23 21:39:21,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:21,038 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-23 21:39:21,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-23 21:39:21,038 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-23 21:39:21,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-23 21:39:21,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:21,039 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 1, 1] [2018-09-23 21:39:21,040 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:21,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:21,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1809009132, now seen corresponding path program 54 times [2018-09-23 21:39:21,040 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:21,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:21,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:21,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:21,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:22,622 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-23 21:39:22,622 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:22,622 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:39:22,630 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:39:22,817 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-09-23 21:39:22,817 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:22,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:22,826 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-23 21:39:22,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:22,835 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-23 21:39:22,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:24,752 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-23 21:39:24,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:24,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 110 [2018-09-23 21:39:24,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-23 21:39:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-23 21:39:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-23 21:39:24,775 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 112 states. [2018-09-23 21:39:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:25,126 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-23 21:39:25,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-23 21:39:25,126 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 220 [2018-09-23 21:39:25,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:25,127 INFO L225 Difference]: With dead ends: 227 [2018-09-23 21:39:25,127 INFO L226 Difference]: Without dead ends: 226 [2018-09-23 21:39:25,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5940 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-09-23 21:39:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-23 21:39:25,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-09-23 21:39:25,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-23 21:39:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-23 21:39:25,134 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 220 [2018-09-23 21:39:25,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:25,134 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-23 21:39:25,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-23 21:39:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-23 21:39:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-23 21:39:25,136 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:25,136 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1] [2018-09-23 21:39:25,136 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:25,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:25,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1545110565, now seen corresponding path program 55 times [2018-09-23 21:39:25,137 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:25,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:25,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:25,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:26,814 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-23 21:39:26,815 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:26,815 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-23 21:39:26,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:39:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:26,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:26,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-23 21:39:26,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:26,901 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-23 21:39:26,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:28,860 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-23 21:39:28,879 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:28,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 112 [2018-09-23 21:39:28,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-23 21:39:28,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-23 21:39:28,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 21:39:28,881 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 114 states. [2018-09-23 21:39:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:29,269 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-23 21:39:29,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-23 21:39:29,270 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 224 [2018-09-23 21:39:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:29,272 INFO L225 Difference]: With dead ends: 231 [2018-09-23 21:39:29,272 INFO L226 Difference]: Without dead ends: 230 [2018-09-23 21:39:29,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-09-23 21:39:29,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-23 21:39:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-09-23 21:39:29,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-23 21:39:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-23 21:39:29,278 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 224 [2018-09-23 21:39:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:29,278 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-23 21:39:29,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-23 21:39:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-23 21:39:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-23 21:39:29,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:29,280 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 1, 1] [2018-09-23 21:39:29,280 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:29,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:29,280 INFO L82 PathProgramCache]: Analyzing trace with hash -699139618, now seen corresponding path program 56 times [2018-09-23 21:39:29,280 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:29,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:29,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:39:29,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:31,214 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-23 21:39:31,214 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:31,214 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-23 21:39:31,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:39:31,286 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:39:31,286 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:31,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:31,300 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-23 21:39:31,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:31,315 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-23 21:39:31,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:33,335 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-23 21:39:33,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:33,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 114 [2018-09-23 21:39:33,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-23 21:39:33,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-23 21:39:33,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 21:39:33,359 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 116 states. [2018-09-23 21:39:33,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:33,777 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-23 21:39:33,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-23 21:39:33,777 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 228 [2018-09-23 21:39:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:33,779 INFO L225 Difference]: With dead ends: 235 [2018-09-23 21:39:33,779 INFO L226 Difference]: Without dead ends: 234 [2018-09-23 21:39:33,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6384 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-09-23 21:39:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-23 21:39:33,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-23 21:39:33,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-23 21:39:33,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-23 21:39:33,785 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 228 [2018-09-23 21:39:33,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:33,785 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-23 21:39:33,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-23 21:39:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-23 21:39:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-23 21:39:33,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:33,786 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1] [2018-09-23 21:39:33,787 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:33,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:33,787 INFO L82 PathProgramCache]: Analyzing trace with hash 905702167, now seen corresponding path program 57 times [2018-09-23 21:39:33,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:33,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:33,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:33,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:33,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:36,258 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-23 21:39:36,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:36,258 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-23 21:39:36,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:39:36,517 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-09-23 21:39:36,518 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:36,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:36,529 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-23 21:39:36,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:36,537 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-23 21:39:36,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:38,744 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-23 21:39:38,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:38,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 116 [2018-09-23 21:39:38,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-23 21:39:38,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-23 21:39:38,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 21:39:38,767 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 118 states. [2018-09-23 21:39:39,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:39,185 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-23 21:39:39,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-23 21:39:39,185 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 232 [2018-09-23 21:39:39,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:39,187 INFO L225 Difference]: With dead ends: 239 [2018-09-23 21:39:39,187 INFO L226 Difference]: Without dead ends: 238 [2018-09-23 21:39:39,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-09-23 21:39:39,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-23 21:39:39,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-09-23 21:39:39,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-23 21:39:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-23 21:39:39,192 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 232 [2018-09-23 21:39:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:39,193 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-23 21:39:39,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-23 21:39:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-23 21:39:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-23 21:39:39,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:39,194 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 1, 1] [2018-09-23 21:39:39,194 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:39,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1318676528, now seen corresponding path program 58 times [2018-09-23 21:39:39,194 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:39,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:39,195 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:39,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:41,390 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-23 21:39:41,391 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:41,391 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-23 21:39:41,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:39:41,473 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:39:41,473 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:41,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:41,482 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-23 21:39:41,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:41,494 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-23 21:39:41,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:43,600 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-23 21:39:43,622 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:43,622 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 118 [2018-09-23 21:39:43,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-23 21:39:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-23 21:39:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-23 21:39:43,624 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 120 states. [2018-09-23 21:39:44,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:44,044 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-23 21:39:44,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-23 21:39:44,044 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 236 [2018-09-23 21:39:44,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:44,046 INFO L225 Difference]: With dead ends: 243 [2018-09-23 21:39:44,046 INFO L226 Difference]: Without dead ends: 242 [2018-09-23 21:39:44,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6844 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-09-23 21:39:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-23 21:39:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-09-23 21:39:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-23 21:39:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-23 21:39:44,051 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 236 [2018-09-23 21:39:44,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:44,051 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-23 21:39:44,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-23 21:39:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-23 21:39:44,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-23 21:39:44,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:44,052 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1] [2018-09-23 21:39:44,053 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:44,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash -372621303, now seen corresponding path program 59 times [2018-09-23 21:39:44,053 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:44,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:44,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:44,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:44,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:46,138 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-23 21:39:46,138 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:46,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 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-23 21:39:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:39:46,302 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-09-23 21:39:46,302 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:46,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:46,315 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-23 21:39:46,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:46,324 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-23 21:39:46,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:48,568 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-23 21:39:48,588 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:48,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 120 [2018-09-23 21:39:48,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-23 21:39:48,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-23 21:39:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 21:39:48,590 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 122 states. [2018-09-23 21:39:48,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:48,971 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-23 21:39:48,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-23 21:39:48,971 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 240 [2018-09-23 21:39:48,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:48,973 INFO L225 Difference]: With dead ends: 247 [2018-09-23 21:39:48,973 INFO L226 Difference]: Without dead ends: 246 [2018-09-23 21:39:48,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-09-23 21:39:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-23 21:39:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-23 21:39:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-23 21:39:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-23 21:39:48,980 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 240 [2018-09-23 21:39:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:48,980 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-23 21:39:48,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-23 21:39:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-23 21:39:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-23 21:39:48,981 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:48,982 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 1, 1] [2018-09-23 21:39:48,982 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:48,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:48,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2067604418, now seen corresponding path program 60 times [2018-09-23 21:39:48,982 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:48,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:48,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:48,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:51,225 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-23 21:39:51,226 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:51,226 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-23 21:39:51,234 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:39:51,451 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-09-23 21:39:51,452 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:39:51,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:51,461 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-23 21:39:51,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:51,469 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-23 21:39:51,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:53,714 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-23 21:39:53,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:53,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 122 [2018-09-23 21:39:53,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-23 21:39:53,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-23 21:39:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-23 21:39:53,737 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 124 states. [2018-09-23 21:39:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:54,242 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-23 21:39:54,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-23 21:39:54,242 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 244 [2018-09-23 21:39:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:54,244 INFO L225 Difference]: With dead ends: 251 [2018-09-23 21:39:54,244 INFO L226 Difference]: Without dead ends: 250 [2018-09-23 21:39:54,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7320 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-09-23 21:39:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-23 21:39:54,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-09-23 21:39:54,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-23 21:39:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-23 21:39:54,250 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 244 [2018-09-23 21:39:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:54,250 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-23 21:39:54,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-23 21:39:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-23 21:39:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-23 21:39:54,251 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:54,252 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1] [2018-09-23 21:39:54,252 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:54,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1934261509, now seen corresponding path program 61 times [2018-09-23 21:39:54,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:54,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:39:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:56,358 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-23 21:39:56,358 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:39:56,358 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-23 21:39:56,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:39:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:39:56,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:39:56,439 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-23 21:39:56,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:39:56,454 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-23 21:39:56,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:39:58,741 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-23 21:39:58,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:39:58,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 124 [2018-09-23 21:39:58,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-23 21:39:58,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-23 21:39:58,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 21:39:58,765 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 126 states. [2018-09-23 21:39:59,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:39:59,202 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-23 21:39:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-23 21:39:59,202 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 248 [2018-09-23 21:39:59,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:39:59,204 INFO L225 Difference]: With dead ends: 255 [2018-09-23 21:39:59,204 INFO L226 Difference]: Without dead ends: 254 [2018-09-23 21:39:59,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-09-23 21:39:59,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-23 21:39:59,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-09-23 21:39:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-23 21:39:59,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-23 21:39:59,210 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 248 [2018-09-23 21:39:59,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:39:59,210 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-23 21:39:59,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-23 21:39:59,210 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-23 21:39:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-23 21:39:59,211 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:39:59,211 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 1, 1] [2018-09-23 21:39:59,211 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:39:59,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:39:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1611242932, now seen corresponding path program 62 times [2018-09-23 21:39:59,212 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:39:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:39:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:59,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:39:59,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:39:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:01,620 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-23 21:40:01,620 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:01,620 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-23 21:40:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:40:01,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:40:01,691 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:01,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:01,700 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-23 21:40:01,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:01,711 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-23 21:40:01,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:04,121 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-23 21:40:04,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:04,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 126 [2018-09-23 21:40:04,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-23 21:40:04,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-23 21:40:04,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-23 21:40:04,145 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 128 states. [2018-09-23 21:40:04,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:04,585 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-23 21:40:04,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-23 21:40:04,586 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 252 [2018-09-23 21:40:04,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:04,588 INFO L225 Difference]: With dead ends: 259 [2018-09-23 21:40:04,588 INFO L226 Difference]: Without dead ends: 258 [2018-09-23 21:40:04,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7812 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-09-23 21:40:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-23 21:40:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-23 21:40:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-23 21:40:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-23 21:40:04,593 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 252 [2018-09-23 21:40:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:04,593 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-23 21:40:04,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-23 21:40:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-23 21:40:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-23 21:40:04,594 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:04,594 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1] [2018-09-23 21:40:04,594 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:04,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash -504384531, now seen corresponding path program 63 times [2018-09-23 21:40:04,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:04,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:04,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:04,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:04,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:06,904 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-23 21:40:06,905 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:06,905 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-23 21:40:06,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:40:07,226 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-09-23 21:40:07,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:07,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:07,240 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-23 21:40:07,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:07,250 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-23 21:40:07,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:09,691 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-23 21:40:09,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:09,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 128 [2018-09-23 21:40:09,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-23 21:40:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-23 21:40:09,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 21:40:09,714 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 130 states. [2018-09-23 21:40:10,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:10,166 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-23 21:40:10,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-23 21:40:10,167 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 256 [2018-09-23 21:40:10,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:10,169 INFO L225 Difference]: With dead ends: 263 [2018-09-23 21:40:10,169 INFO L226 Difference]: Without dead ends: 262 [2018-09-23 21:40:10,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8064 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-09-23 21:40:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-23 21:40:10,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-09-23 21:40:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-23 21:40:10,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-23 21:40:10,176 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 256 [2018-09-23 21:40:10,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:10,176 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-23 21:40:10,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-23 21:40:10,176 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-23 21:40:10,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-23 21:40:10,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:10,177 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 1, 1] [2018-09-23 21:40:10,178 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:10,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:10,178 INFO L82 PathProgramCache]: Analyzing trace with hash 972948902, now seen corresponding path program 64 times [2018-09-23 21:40:10,178 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:10,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:10,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:12,612 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-23 21:40:12,613 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:12,613 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:40:12,623 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:40:12,695 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:40:12,695 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:12,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:12,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-23 21:40:12,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:12,724 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-23 21:40:12,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:15,572 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-23 21:40:15,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:15,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 130 [2018-09-23 21:40:15,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-23 21:40:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-23 21:40:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 21:40:15,595 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 132 states. [2018-09-23 21:40:16,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:16,071 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-23 21:40:16,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-23 21:40:16,072 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 260 [2018-09-23 21:40:16,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:16,073 INFO L225 Difference]: With dead ends: 267 [2018-09-23 21:40:16,073 INFO L226 Difference]: Without dead ends: 266 [2018-09-23 21:40:16,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8320 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-09-23 21:40:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-23 21:40:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-09-23 21:40:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-23 21:40:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-23 21:40:16,081 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 260 [2018-09-23 21:40:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:16,081 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-23 21:40:16,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-23 21:40:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-23 21:40:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-23 21:40:16,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:16,083 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1] [2018-09-23 21:40:16,083 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:16,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1521144543, now seen corresponding path program 65 times [2018-09-23 21:40:16,083 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:16,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:16,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:16,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:16,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:18,533 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-23 21:40:18,534 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:18,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 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-23 21:40:18,541 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:40:18,731 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-09-23 21:40:18,731 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:18,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:18,740 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-23 21:40:18,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:18,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-23 21:40:18,752 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:21,355 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-23 21:40:21,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:21,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 132 [2018-09-23 21:40:21,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-23 21:40:21,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-23 21:40:21,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-09-23 21:40:21,383 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 134 states. [2018-09-23 21:40:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:21,935 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-23 21:40:21,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-23 21:40:21,935 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 264 [2018-09-23 21:40:21,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:21,937 INFO L225 Difference]: With dead ends: 271 [2018-09-23 21:40:21,937 INFO L226 Difference]: Without dead ends: 270 [2018-09-23 21:40:21,938 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-23 21:40:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-23 21:40:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-23 21:40:21,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-23 21:40:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-23 21:40:21,942 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 264 [2018-09-23 21:40:21,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:21,942 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-23 21:40:21,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-23 21:40:21,942 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-23 21:40:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-23 21:40:21,944 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:21,944 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 1, 1] [2018-09-23 21:40:21,944 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:21,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:21,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1857266792, now seen corresponding path program 66 times [2018-09-23 21:40:21,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:21,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:21,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:21,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:24,205 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-23 21:40:24,206 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:24,206 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:40:24,212 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:40:24,467 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-09-23 21:40:24,467 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:24,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:24,476 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-23 21:40:24,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:24,484 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-23 21:40:24,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:27,409 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-23 21:40:27,430 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:27,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 134 [2018-09-23 21:40:27,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-23 21:40:27,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-23 21:40:27,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-23 21:40:27,433 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 136 states. [2018-09-23 21:40:27,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:27,975 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-23 21:40:27,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-23 21:40:27,976 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 268 [2018-09-23 21:40:27,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:27,977 INFO L225 Difference]: With dead ends: 275 [2018-09-23 21:40:27,977 INFO L226 Difference]: Without dead ends: 274 [2018-09-23 21:40:27,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8844 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-09-23 21:40:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-23 21:40:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-09-23 21:40:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-23 21:40:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-23 21:40:27,983 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 268 [2018-09-23 21:40:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-23 21:40:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-23 21:40:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-23 21:40:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-23 21:40:27,984 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:27,984 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1] [2018-09-23 21:40:27,984 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:27,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash 370728913, now seen corresponding path program 67 times [2018-09-23 21:40:27,985 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:27,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:27,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:30,351 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-23 21:40:30,351 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:30,351 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-23 21:40:30,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:40:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:30,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:30,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-23 21:40:30,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:30,447 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-23 21:40:30,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:33,425 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-23 21:40:33,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:33,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 136 [2018-09-23 21:40:33,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-23 21:40:33,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-23 21:40:33,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-23 21:40:33,447 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 138 states. [2018-09-23 21:40:33,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:33,883 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-23 21:40:33,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-23 21:40:33,884 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 272 [2018-09-23 21:40:33,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:33,886 INFO L225 Difference]: With dead ends: 279 [2018-09-23 21:40:33,886 INFO L226 Difference]: Without dead ends: 278 [2018-09-23 21:40:33,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9112 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-09-23 21:40:33,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-23 21:40:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-09-23 21:40:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-23 21:40:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-23 21:40:33,893 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 272 [2018-09-23 21:40:33,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:33,893 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-23 21:40:33,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-23 21:40:33,893 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-23 21:40:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-23 21:40:33,895 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:33,895 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 1, 1] [2018-09-23 21:40:33,895 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:33,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1675190390, now seen corresponding path program 68 times [2018-09-23 21:40:33,896 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:33,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:33,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:40:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:33,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:36,267 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-23 21:40:36,267 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:36,267 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-23 21:40:36,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:40:36,341 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:40:36,341 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:36,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:36,351 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-23 21:40:36,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:36,364 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-23 21:40:36,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:39,494 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-23 21:40:39,515 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:39,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 138 [2018-09-23 21:40:39,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-23 21:40:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-23 21:40:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-09-23 21:40:39,519 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 140 states. [2018-09-23 21:40:40,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:40,046 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-23 21:40:40,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-23 21:40:40,047 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 276 [2018-09-23 21:40:40,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:40,049 INFO L225 Difference]: With dead ends: 283 [2018-09-23 21:40:40,049 INFO L226 Difference]: Without dead ends: 282 [2018-09-23 21:40:40,051 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-23 21:40:40,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-23 21:40:40,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-23 21:40:40,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-23 21:40:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-23 21:40:40,056 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 276 [2018-09-23 21:40:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:40,057 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-23 21:40:40,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-23 21:40:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-23 21:40:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-23 21:40:40,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:40,059 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1] [2018-09-23 21:40:40,059 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:40,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:40,060 INFO L82 PathProgramCache]: Analyzing trace with hash -513025341, now seen corresponding path program 69 times [2018-09-23 21:40:40,060 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:40,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:40,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:40,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:40,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:42,874 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-23 21:40:42,875 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:42,875 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-23 21:40:42,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:40:43,248 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-09-23 21:40:43,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:43,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:43,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-23 21:40:43,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:43,269 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-23 21:40:43,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:46,148 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-23 21:40:46,169 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:46,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 140 [2018-09-23 21:40:46,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-23 21:40:46,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-23 21:40:46,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 21:40:46,173 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 142 states. [2018-09-23 21:40:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:46,640 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-23 21:40:46,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-23 21:40:46,640 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 280 [2018-09-23 21:40:46,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:46,642 INFO L225 Difference]: With dead ends: 287 [2018-09-23 21:40:46,642 INFO L226 Difference]: Without dead ends: 286 [2018-09-23 21:40:46,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9660 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-09-23 21:40:46,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-23 21:40:46,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-09-23 21:40:46,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-23 21:40:46,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-23 21:40:46,648 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 280 [2018-09-23 21:40:46,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:46,648 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-23 21:40:46,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-23 21:40:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-23 21:40:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-23 21:40:46,649 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:46,650 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 1, 1] [2018-09-23 21:40:46,650 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:46,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1052692860, now seen corresponding path program 70 times [2018-09-23 21:40:46,650 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:46,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:46,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:46,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:49,354 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-23 21:40:49,355 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:49,355 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-23 21:40:49,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-23 21:40:49,445 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-23 21:40:49,445 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:49,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:49,456 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-23 21:40:49,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:49,464 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-23 21:40:49,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:52,680 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-23 21:40:52,701 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:52,701 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 142 [2018-09-23 21:40:52,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-23 21:40:52,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-23 21:40:52,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-23 21:40:52,704 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 144 states. [2018-09-23 21:40:53,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:40:53,294 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-23 21:40:53,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-23 21:40:53,294 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 284 [2018-09-23 21:40:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:40:53,296 INFO L225 Difference]: With dead ends: 291 [2018-09-23 21:40:53,296 INFO L226 Difference]: Without dead ends: 290 [2018-09-23 21:40:53,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9940 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-09-23 21:40:53,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-23 21:40:53,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-09-23 21:40:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-23 21:40:53,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-23 21:40:53,302 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 284 [2018-09-23 21:40:53,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:40:53,303 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-23 21:40:53,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-23 21:40:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-23 21:40:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-23 21:40:53,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:40:53,304 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 1, 1] [2018-09-23 21:40:53,304 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:40:53,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:40:53,304 INFO L82 PathProgramCache]: Analyzing trace with hash 936756149, now seen corresponding path program 71 times [2018-09-23 21:40:53,304 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:40:53,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:40:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:53,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:40:53,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:40:53,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:40:55,958 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-23 21:40:55,959 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:40:55,959 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-23 21:40:55,965 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-23 21:40:56,177 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-09-23 21:40:56,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:40:56,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:40:56,188 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-23 21:40:56,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:40:56,196 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-23 21:40:56,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:40:59,468 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-23 21:40:59,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:40:59,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 144 [2018-09-23 21:40:59,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-23 21:40:59,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-23 21:40:59,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 21:40:59,493 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 146 states. [2018-09-23 21:41:00,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:41:00,013 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-23 21:41:00,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-23 21:41:00,014 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 288 [2018-09-23 21:41:00,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:41:00,015 INFO L225 Difference]: With dead ends: 295 [2018-09-23 21:41:00,016 INFO L226 Difference]: Without dead ends: 294 [2018-09-23 21:41:00,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10224 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-09-23 21:41:00,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-23 21:41:00,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-23 21:41:00,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-23 21:41:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-23 21:41:00,024 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 288 [2018-09-23 21:41:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:41:00,024 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-23 21:41:00,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-23 21:41:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-23 21:41:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-23 21:41:00,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:41:00,026 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 1, 1] [2018-09-23 21:41:00,026 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:41:00,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:41:00,026 INFO L82 PathProgramCache]: Analyzing trace with hash 189198702, now seen corresponding path program 72 times [2018-09-23 21:41:00,026 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:41:00,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:41:00,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:00,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:41:00,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:41:02,653 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-23 21:41:02,654 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:41:02,654 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 21:41:02,661 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-23 21:41:02,969 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-09-23 21:41:02,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:41:02,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:41:02,980 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-23 21:41:02,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:41:02,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-23 21:41:02,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:41:05,984 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-23 21:41:06,004 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:41:06,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 146 [2018-09-23 21:41:06,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-23 21:41:06,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-23 21:41:06,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-23 21:41:06,007 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 148 states. [2018-09-23 21:41:06,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:41:06,473 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-23 21:41:06,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-23 21:41:06,474 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 292 [2018-09-23 21:41:06,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:41:06,475 INFO L225 Difference]: With dead ends: 299 [2018-09-23 21:41:06,475 INFO L226 Difference]: Without dead ends: 298 [2018-09-23 21:41:06,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10512 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-09-23 21:41:06,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-23 21:41:06,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-09-23 21:41:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-23 21:41:06,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-23 21:41:06,482 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 292 [2018-09-23 21:41:06,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:41:06,482 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-23 21:41:06,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-23 21:41:06,482 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-23 21:41:06,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-23 21:41:06,483 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:41:06,483 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 1, 1] [2018-09-23 21:41:06,483 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:41:06,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:41:06,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1116248743, now seen corresponding path program 73 times [2018-09-23 21:41:06,484 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:41:06,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:41:06,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:06,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:41:06,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:41:09,221 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-23 21:41:09,221 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:41:09,221 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-23 21:41:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:41:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:41:09,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:41:09,311 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-23 21:41:09,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:41:09,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-23 21:41:09,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:41:12,440 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-23 21:41:12,462 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:41:12,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 148 [2018-09-23 21:41:12,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-23 21:41:12,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-23 21:41:12,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-23 21:41:12,465 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 150 states. [2018-09-23 21:41:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:41:12,990 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-23 21:41:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-23 21:41:12,990 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 296 [2018-09-23 21:41:12,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:41:12,991 INFO L225 Difference]: With dead ends: 303 [2018-09-23 21:41:12,991 INFO L226 Difference]: Without dead ends: 302 [2018-09-23 21:41:12,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10804 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-09-23 21:41:12,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-23 21:41:12,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-09-23 21:41:12,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-23 21:41:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-23 21:41:12,997 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 296 [2018-09-23 21:41:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:41:12,997 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-23 21:41:12,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-23 21:41:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-23 21:41:12,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-23 21:41:12,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:41:12,999 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 1, 1] [2018-09-23 21:41:12,999 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:41:12,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:41:12,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1106313056, now seen corresponding path program 74 times [2018-09-23 21:41:12,999 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:41:12,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:41:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:13,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-23 21:41:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:41:15,676 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-23 21:41:15,676 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:41:15,676 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-23 21:41:15,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-23 21:41:15,751 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-23 21:41:15,751 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:41:15,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:41:15,760 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-23 21:41:15,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:41:15,774 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-23 21:41:15,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:41:18,908 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-23 21:41:18,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:41:18,929 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 150 [2018-09-23 21:41:18,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-23 21:41:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-23 21:41:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-23 21:41:18,932 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 152 states. [2018-09-23 21:41:19,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:41:19,416 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-23 21:41:19,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-23 21:41:19,417 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 300 [2018-09-23 21:41:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:41:19,419 INFO L225 Difference]: With dead ends: 307 [2018-09-23 21:41:19,419 INFO L226 Difference]: Without dead ends: 306 [2018-09-23 21:41:19,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11100 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-09-23 21:41:19,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-23 21:41:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-09-23 21:41:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-23 21:41:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-23 21:41:19,425 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 300 [2018-09-23 21:41:19,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:41:19,425 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-23 21:41:19,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-23 21:41:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-23 21:41:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-23 21:41:19,426 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:41:19,426 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 1, 1] [2018-09-23 21:41:19,426 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:41:19,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:41:19,427 INFO L82 PathProgramCache]: Analyzing trace with hash -659136615, now seen corresponding path program 75 times [2018-09-23 21:41:19,427 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:41:19,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:41:19,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:19,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:41:19,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:19,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-23 21:41:22,219 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-23 21:41:22,219 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-23 21:41:22,219 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-23 21:41:22,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-23 21:41:22,647 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-09-23 21:41:22,647 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-23 21:41:22,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-23 21:41:22,656 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-23 21:41:22,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-23 21:41:22,667 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-23 21:41:22,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-09-23 21:41:25,922 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-23 21:41:25,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-23 21:41:25,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 152 [2018-09-23 21:41:25,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-23 21:41:25,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-23 21:41:25,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-23 21:41:25,946 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 154 states. [2018-09-23 21:41:26,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-23 21:41:26,451 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-23 21:41:26,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-23 21:41:26,452 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 304 [2018-09-23 21:41:26,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-23 21:41:26,454 INFO L225 Difference]: With dead ends: 311 [2018-09-23 21:41:26,454 INFO L226 Difference]: Without dead ends: 310 [2018-09-23 21:41:26,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11400 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-09-23 21:41:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-23 21:41:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 309. [2018-09-23 21:41:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-23 21:41:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-23 21:41:26,460 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 304 [2018-09-23 21:41:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-23 21:41:26,460 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-23 21:41:26,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-23 21:41:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-23 21:41:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-23 21:41:26,461 INFO L367 BasicCegarLoop]: Found error trace [2018-09-23 21:41:26,461 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 1, 1] [2018-09-23 21:41:26,461 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-23 21:41:26,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-23 21:41:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash -789644462, now seen corresponding path program 76 times [2018-09-23 21:41:26,462 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-23 21:41:26,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-23 21:41:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:26,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-23 21:41:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-23 21:41:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-23 21:41:26,649 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-23 21:41:26,653 WARN L206 ceAbstractionStarter]: Timeout [2018-09-23 21:41:26,653 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.09 09:41:26 BoogieIcfgContainer [2018-09-23 21:41:26,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-23 21:41:26,654 INFO L168 Benchmark]: Toolchain (without parser) took 238401.26 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -558.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-23 21:41:26,655 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:41:26,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:41:26,656 INFO L168 Benchmark]: Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-23 21:41:26,656 INFO L168 Benchmark]: RCFGBuilder took 369.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2018-09-23 21:41:26,657 INFO L168 Benchmark]: TraceAbstraction took 237942.19 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -577.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2018-09-23 21:41:26,658 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 369.07 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 237942.19 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -577.5 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 15]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 15). Cancelled while BasicCegarLoop was analyzing trace of length 309 with TraceHistMax 77, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 3 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. TIMEOUT Result, 237.8s OverallTime, 77 OverallIterations, 77 TraceHistogramMax, 23.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 229 SDtfs, 4233 SDslu, 4298 SDs, 0 SdLazy, 16000 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14551 GetRequests, 8700 SyntacticMatches, 0 SemanticMatches, 5851 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292600 ImplicationChecksByTransitivity, 185.2s 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.4s SsaConstructionTime, 8.7s SatisfiabilityAnalysisTime, 198.1s 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-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-23_21-41-26-668.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement-simplified03.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-23_21-41-26-668.csv Completed graceful shutdown