java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fa1c628-m [2019-01-31 17:34:15,222 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-31 17:34:15,224 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-31 17:34:15,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-31 17:34:15,243 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-31 17:34:15,244 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-31 17:34:15,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-31 17:34:15,247 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-31 17:34:15,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-31 17:34:15,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-31 17:34:15,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-31 17:34:15,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-31 17:34:15,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-31 17:34:15,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-31 17:34:15,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-31 17:34:15,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-31 17:34:15,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-31 17:34:15,270 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-31 17:34:15,274 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-31 17:34:15,275 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-31 17:34:15,278 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-31 17:34:15,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-31 17:34:15,283 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-31 17:34:15,283 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-31 17:34:15,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-31 17:34:15,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-31 17:34:15,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-31 17:34:15,290 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-31 17:34:15,291 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-31 17:34:15,292 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-31 17:34:15,292 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-31 17:34:15,293 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-31 17:34:15,293 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-31 17:34:15,293 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-31 17:34:15,296 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-31 17:34:15,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-31 17:34:15,297 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-31 17:34:15,313 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-31 17:34:15,313 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-31 17:34:15,314 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-31 17:34:15,314 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-31 17:34:15,314 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-31 17:34:15,314 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-31 17:34:15,315 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-31 17:34:15,315 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-31 17:34:15,315 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-31 17:34:15,315 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-31 17:34:15,315 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-31 17:34:15,316 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-31 17:34:15,316 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-31 17:34:15,316 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-31 17:34:15,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-31 17:34:15,317 INFO L133 SettingsManager]: * Use SBE=true [2019-01-31 17:34:15,317 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-31 17:34:15,317 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-31 17:34:15,317 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-31 17:34:15,318 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-31 17:34:15,318 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-31 17:34:15,318 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-31 17:34:15,318 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-31 17:34:15,318 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-31 17:34:15,318 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-31 17:34:15,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-31 17:34:15,319 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-31 17:34:15,319 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-31 17:34:15,319 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-31 17:34:15,319 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-31 17:34:15,320 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:15,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-31 17:34:15,320 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-31 17:34:15,320 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-31 17:34:15,320 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-31 17:34:15,321 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-31 17:34:15,321 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-01-31 17:34:15,321 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-31 17:34:15,321 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-31 17:34:15,357 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-31 17:34:15,368 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-31 17:34:15,372 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-31 17:34:15,374 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-31 17:34:15,376 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-31 17:34:15,377 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl [2019-01-31 17:34:15,377 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-4-limited.bpl' [2019-01-31 17:34:15,416 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-31 17:34:15,417 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-31 17:34:15,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:15,418 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-31 17:34:15,418 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-31 17:34:15,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,451 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-31 17:34:15,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-31 17:34:15,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-31 17:34:15,480 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-31 17:34:15,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/1) ... [2019-01-31 17:34:15,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-31 17:34:15,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-31 17:34:15,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-31 17:34:15,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-31 17:34:15,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-01-31 17:34:15,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-31 17:34:15,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-31 17:34:15,861 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-31 17:34:15,862 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-31 17:34:15,863 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:15 BoogieIcfgContainer [2019-01-31 17:34:15,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-31 17:34:15,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-31 17:34:15,865 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-31 17:34:15,868 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-31 17:34:15,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 31.01 05:34:15" (1/2) ... [2019-01-31 17:34:15,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49ca7609 and model type speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:34:15, skipping insertion in model container [2019-01-31 17:34:15,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-4-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:34:15" (2/2) ... [2019-01-31 17:34:15,871 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-4-limited.bpl [2019-01-31 17:34:15,881 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-31 17:34:15,889 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-31 17:34:15,901 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-31 17:34:15,931 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-31 17:34:15,931 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-31 17:34:15,931 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-31 17:34:15,931 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-31 17:34:15,932 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-31 17:34:15,932 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-31 17:34:15,932 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-31 17:34:15,932 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-31 17:34:15,946 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-31 17:34:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-31 17:34:15,952 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:15,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-31 17:34:15,955 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:15,961 INFO L82 PathProgramCache]: Analyzing trace with hash 980, now seen corresponding path program 1 times [2019-01-31 17:34:15,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:16,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:16,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:16,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:16,181 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:34:16,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:34:16,181 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:16,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:34:16,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:34:16,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:34:16,208 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2019-01-31 17:34:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:34:16,410 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2019-01-31 17:34:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:34:16,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-31 17:34:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:34:16,424 INFO L225 Difference]: With dead ends: 21 [2019-01-31 17:34:16,425 INFO L226 Difference]: Without dead ends: 16 [2019-01-31 17:34:16,428 INFO L631 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 [2019-01-31 17:34:16,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-31 17:34:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2019-01-31 17:34:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-31 17:34:16,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2019-01-31 17:34:16,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 17 transitions. Word has length 2 [2019-01-31 17:34:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:34:16,468 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 17 transitions. [2019-01-31 17:34:16,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:34:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 17 transitions. [2019-01-31 17:34:16,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:34:16,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:34:16,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:34:16,470 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:34:16,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:16,470 INFO L82 PathProgramCache]: Analyzing trace with hash 30306, now seen corresponding path program 1 times [2019-01-31 17:34:16,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:34:16,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:34:16,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:34:16,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:34:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:34:16,754 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-31 17:34:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:34:16,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:34:16,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:34:16,779 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:34:16,781 INFO L207 CegarAbsIntRunner]: [0], [16], [19] [2019-01-31 17:34:16,830 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:34:16,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:34:25,568 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:34:25,570 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:34:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:34:25,575 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:34:26,753 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-31 17:34:26,754 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:34:27,613 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-31 17:34:27,613 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:34:27,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:34:27,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-31 17:34:27,615 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:34:27,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:34:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:34:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:34:27,620 INFO L87 Difference]: Start difference. First operand 10 states and 17 transitions. Second operand 4 states. [2019-01-31 17:35:12,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:12,743 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2019-01-31 17:35:12,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:35:12,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:35:12,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:12,745 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:35:12,745 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:35:12,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:35:12,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:35:12,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 13. [2019-01-31 17:35:12,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:35:12,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 25 transitions. [2019-01-31 17:35:12,752 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 25 transitions. Word has length 3 [2019-01-31 17:35:12,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:12,752 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 25 transitions. [2019-01-31 17:35:12,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:12,753 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 25 transitions. [2019-01-31 17:35:12,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:35:12,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:12,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:35:12,754 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:12,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:12,755 INFO L82 PathProgramCache]: Analyzing trace with hash 30432, now seen corresponding path program 1 times [2019-01-31 17:35:12,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:12,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:12,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:12,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:12,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:12,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:35:12,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:35:12,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:12,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:35:12,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:35:12,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:35:12,811 INFO L87 Difference]: Start difference. First operand 13 states and 25 transitions. Second operand 3 states. [2019-01-31 17:35:12,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:12,988 INFO L93 Difference]: Finished difference Result 15 states and 25 transitions. [2019-01-31 17:35:12,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:12,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:35:12,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:12,989 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:35:12,989 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:35:12,990 INFO L631 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 [2019-01-31 17:35:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:35:12,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-01-31 17:35:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-31 17:35:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 24 transitions. [2019-01-31 17:35:12,996 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 24 transitions. Word has length 3 [2019-01-31 17:35:12,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:12,997 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 24 transitions. [2019-01-31 17:35:12,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:35:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 24 transitions. [2019-01-31 17:35:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:35:12,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:12,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:35:12,998 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:12,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:12,998 INFO L82 PathProgramCache]: Analyzing trace with hash 29996, now seen corresponding path program 1 times [2019-01-31 17:35:12,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:12,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:13,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:13,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:13,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:13,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:13,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:13,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:13,081 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:35:13,081 INFO L207 CegarAbsIntRunner]: [0], [6], [19] [2019-01-31 17:35:13,084 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:13,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:18,322 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:35:18,323 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:35:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:18,323 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:35:20,267 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2019-01-31 17:35:20,267 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:35:21,459 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-31 17:35:21,459 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:35:21,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:35:21,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [2] total 3 [2019-01-31 17:35:21,460 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:35:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:35:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:35:21,461 INFO L87 Difference]: Start difference. First operand 13 states and 24 transitions. Second operand 3 states. [2019-01-31 17:35:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:21,662 INFO L93 Difference]: Finished difference Result 15 states and 30 transitions. [2019-01-31 17:35:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:21,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-31 17:35:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:21,662 INFO L225 Difference]: With dead ends: 15 [2019-01-31 17:35:21,663 INFO L226 Difference]: Without dead ends: 14 [2019-01-31 17:35:21,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:35:21,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-31 17:35:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-31 17:35:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-31 17:35:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2019-01-31 17:35:21,669 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 29 transitions. Word has length 3 [2019-01-31 17:35:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:21,670 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 29 transitions. [2019-01-31 17:35:21,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:35:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 29 transitions. [2019-01-31 17:35:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-31 17:35:21,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:21,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-31 17:35:21,671 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:21,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash 30120, now seen corresponding path program 1 times [2019-01-31 17:35:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:21,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:21,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:21,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:21,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:21,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:21,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:21,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:21,743 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-31 17:35:21,744 INFO L207 CegarAbsIntRunner]: [0], [10], [19] [2019-01-31 17:35:21,749 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:21,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:28,004 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:35:28,005 INFO L272 AbstractInterpreter]: Visited 3 different actions 13 times. Merged at 1 different actions 5 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:35:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:28,005 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:35:29,755 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 68.75% of their original sizes. [2019-01-31 17:35:29,756 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:35:30,555 INFO L420 sIntCurrentIteration]: We unified 2 AI predicates to 2 [2019-01-31 17:35:30,555 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:35:30,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:35:30,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-31 17:35:30,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:30,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:35:30,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:35:30,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:35:30,557 INFO L87 Difference]: Start difference. First operand 14 states and 29 transitions. Second operand 4 states. [2019-01-31 17:35:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:31,187 INFO L93 Difference]: Finished difference Result 22 states and 40 transitions. [2019-01-31 17:35:31,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:35:31,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-31 17:35:31,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:31,188 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:35:31,188 INFO L226 Difference]: Without dead ends: 20 [2019-01-31 17:35:31,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:35:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-31 17:35:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2019-01-31 17:35:31,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:35:31,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2019-01-31 17:35:31,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 35 transitions. Word has length 3 [2019-01-31 17:35:31,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:31,195 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 35 transitions. [2019-01-31 17:35:31,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:35:31,195 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 35 transitions. [2019-01-31 17:35:31,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:31,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:31,196 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1] [2019-01-31 17:35:31,196 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:31,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:31,197 INFO L82 PathProgramCache]: Analyzing trace with hash 939412, now seen corresponding path program 2 times [2019-01-31 17:35:31,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:31,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:35:31,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:31,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:31,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-31 17:35:31,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:31,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:31,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-31 17:35:31,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-31 17:35:31,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:31,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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 [2019-01-31 17:35:31,273 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-31 17:35:31,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-31 17:35:31,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-31 17:35:31,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-31 17:35:31,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-31 17:35:31,335 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2019-01-31 17:35:31,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2019-01-31 17:35:31,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 34 [2019-01-31 17:35:31,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2019-01-31 17:35:31,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,491 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,500 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-31 17:35:31,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:31,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:25, output treesize:30 [2019-01-31 17:35:31,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:31,857 INFO L303 Elim1Store]: Index analysis took 189 ms [2019-01-31 17:35:31,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-31 17:35:31,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:32,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:32,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-31 17:35:32,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-31 17:35:32,457 INFO L303 Elim1Store]: Index analysis took 166 ms [2019-01-31 17:35:32,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 57 [2019-01-31 17:35:32,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-31 17:35:32,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-31 17:35:32,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-31 17:35:32,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:32,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-31 17:35:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:33,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-31 17:35:33,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-31 17:35:33,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-31 17:35:33,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-31 17:35:33,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-31 17:35:33,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-31 17:35:33,041 INFO L87 Difference]: Start difference. First operand 16 states and 35 transitions. Second operand 7 states. [2019-01-31 17:35:33,604 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-31 17:35:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:35:33,917 INFO L93 Difference]: Finished difference Result 38 states and 62 transitions. [2019-01-31 17:35:33,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:35:33,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 4 [2019-01-31 17:35:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:35:33,919 INFO L225 Difference]: With dead ends: 38 [2019-01-31 17:35:33,919 INFO L226 Difference]: Without dead ends: 35 [2019-01-31 17:35:33,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-31 17:35:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-31 17:35:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 18. [2019-01-31 17:35:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:35:33,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-01-31 17:35:33,928 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 4 [2019-01-31 17:35:33,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:35:33,928 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-01-31 17:35:33,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-31 17:35:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-01-31 17:35:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:35:33,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:35:33,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:35:33,929 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:35:33,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:33,930 INFO L82 PathProgramCache]: Analyzing trace with hash 939538, now seen corresponding path program 1 times [2019-01-31 17:35:33,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:35:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:33,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-31 17:35:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:35:33,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:35:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:35:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:35:34,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:35:34,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:35:34,010 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:35:34,010 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [21] [2019-01-31 17:35:34,012 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:35:34,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:35:42,343 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:35:42,343 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 2 different actions 8 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:35:42,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:35:42,343 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:35:43,989 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-31 17:35:43,989 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:35:45,621 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:35:45,621 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:35:45,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:35:45,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-31 17:35:45,622 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:35:45,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:35:45,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:35:45,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:35:45,622 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 5 states. [2019-01-31 17:36:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:36,185 INFO L93 Difference]: Finished difference Result 24 states and 47 transitions. [2019-01-31 17:36:36,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:36:36,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:36:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:36,186 INFO L225 Difference]: With dead ends: 24 [2019-01-31 17:36:36,186 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:36:36,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:36:36,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:36:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2019-01-31 17:36:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:36:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 35 transitions. [2019-01-31 17:36:36,194 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 35 transitions. Word has length 4 [2019-01-31 17:36:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:36,194 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 35 transitions. [2019-01-31 17:36:36,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:36:36,195 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 35 transitions. [2019-01-31 17:36:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:36,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:36,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:36,195 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:36,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash 939102, now seen corresponding path program 1 times [2019-01-31 17:36:36,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:36,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:36,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:36,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:36,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:36,267 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:36,268 INFO L207 CegarAbsIntRunner]: [0], [6], [16], [19] [2019-01-31 17:36:36,269 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:36,269 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:36:49,945 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:36:49,945 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:36:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:49,945 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:36:51,554 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 70.83% of their original sizes. [2019-01-31 17:36:51,554 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:36:52,760 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:36:52,760 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:36:52,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:36:52,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-31 17:36:52,761 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:36:52,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:36:52,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:36:52,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:36:52,762 INFO L87 Difference]: Start difference. First operand 16 states and 35 transitions. Second operand 4 states. [2019-01-31 17:36:53,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:36:53,980 INFO L93 Difference]: Finished difference Result 26 states and 57 transitions. [2019-01-31 17:36:53,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:36:53,980 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:36:53,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:36:53,981 INFO L225 Difference]: With dead ends: 26 [2019-01-31 17:36:53,981 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:36:53,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:36:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:36:54,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2019-01-31 17:36:54,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:36:54,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 42 transitions. [2019-01-31 17:36:54,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 42 transitions. Word has length 4 [2019-01-31 17:36:54,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:36:54,002 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 42 transitions. [2019-01-31 17:36:54,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:36:54,002 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 42 transitions. [2019-01-31 17:36:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:36:54,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:36:54,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:36:54,003 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:36:54,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:36:54,003 INFO L82 PathProgramCache]: Analyzing trace with hash 939226, now seen corresponding path program 1 times [2019-01-31 17:36:54,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:36:54,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:54,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:36:54,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:36:54,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:36:54,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:36:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:36:54,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:36:54,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:36:54,108 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:36:54,108 INFO L207 CegarAbsIntRunner]: [0], [10], [16], [19] [2019-01-31 17:36:54,109 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:36:54,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:37:08,073 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:37:08,073 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:37:08,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:37:08,073 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:37:09,081 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-31 17:37:09,081 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:37:12,420 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:37:12,420 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:37:12,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:37:12,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-31 17:37:12,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:37:12,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:37:12,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:37:12,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:37:12,422 INFO L87 Difference]: Start difference. First operand 18 states and 42 transitions. Second operand 5 states. [2019-01-31 17:38:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:05,768 INFO L93 Difference]: Finished difference Result 27 states and 54 transitions. [2019-01-31 17:38:05,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:38:05,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:38:05,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:05,769 INFO L225 Difference]: With dead ends: 27 [2019-01-31 17:38:05,769 INFO L226 Difference]: Without dead ends: 23 [2019-01-31 17:38:05,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:38:05,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-31 17:38:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 16. [2019-01-31 17:38:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-31 17:38:05,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 36 transitions. [2019-01-31 17:38:05,787 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 36 transitions. Word has length 4 [2019-01-31 17:38:05,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:05,787 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 36 transitions. [2019-01-31 17:38:05,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:38:05,787 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 36 transitions. [2019-01-31 17:38:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:38:05,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:05,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:38:05,788 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 943446, now seen corresponding path program 1 times [2019-01-31 17:38:05,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:05,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:05,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:05,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:05,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-31 17:38:05,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-31 17:38:05,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:38:05,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-31 17:38:05,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-31 17:38:05,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-31 17:38:05,811 INFO L87 Difference]: Start difference. First operand 16 states and 36 transitions. Second operand 3 states. [2019-01-31 17:38:05,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:05,867 INFO L93 Difference]: Finished difference Result 20 states and 43 transitions. [2019-01-31 17:38:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:38:05,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-31 17:38:05,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:05,868 INFO L225 Difference]: With dead ends: 20 [2019-01-31 17:38:05,868 INFO L226 Difference]: Without dead ends: 17 [2019-01-31 17:38:05,869 INFO L631 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 [2019-01-31 17:38:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-31 17:38:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-31 17:38:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-31 17:38:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 40 transitions. [2019-01-31 17:38:05,892 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 40 transitions. Word has length 4 [2019-01-31 17:38:05,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:05,892 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 40 transitions. [2019-01-31 17:38:05,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-31 17:38:05,892 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 40 transitions. [2019-01-31 17:38:05,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:38:05,892 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:05,892 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:38:05,893 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:05,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:05,893 INFO L82 PathProgramCache]: Analyzing trace with hash 929928, now seen corresponding path program 1 times [2019-01-31 17:38:05,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:05,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:05,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:05,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:05,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:05,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:05,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:05,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:05,982 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:38:05,982 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [21] [2019-01-31 17:38:05,983 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:05,984 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:10,402 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:38:10,402 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:38:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:10,403 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:38:11,029 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 66.67% of their original sizes. [2019-01-31 17:38:11,029 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:38:11,504 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:38:11,504 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:38:11,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:38:11,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 4 [2019-01-31 17:38:11,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:38:11,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:38:11,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:38:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:38:11,505 INFO L87 Difference]: Start difference. First operand 17 states and 40 transitions. Second operand 4 states. [2019-01-31 17:38:12,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:12,047 INFO L93 Difference]: Finished difference Result 22 states and 48 transitions. [2019-01-31 17:38:12,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:38:12,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:38:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:12,048 INFO L225 Difference]: With dead ends: 22 [2019-01-31 17:38:12,048 INFO L226 Difference]: Without dead ends: 21 [2019-01-31 17:38:12,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:38:12,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-31 17:38:12,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2019-01-31 17:38:12,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-31 17:38:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 45 transitions. [2019-01-31 17:38:12,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 45 transitions. Word has length 4 [2019-01-31 17:38:12,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:12,074 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 45 transitions. [2019-01-31 17:38:12,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:38:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 45 transitions. [2019-01-31 17:38:12,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:38:12,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:12,075 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:38:12,075 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:12,076 INFO L82 PathProgramCache]: Analyzing trace with hash 929616, now seen corresponding path program 1 times [2019-01-31 17:38:12,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:12,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:12,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:12,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:12,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:12,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:12,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:12,166 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:38:12,166 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [19] [2019-01-31 17:38:12,167 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:12,167 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:23,770 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:38:23,770 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:38:23,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:23,771 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:38:24,586 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 66.67% of their original sizes. [2019-01-31 17:38:24,586 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:38:24,995 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:38:24,995 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:38:24,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:38:24,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2019-01-31 17:38:24,996 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:38:24,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-31 17:38:24,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-31 17:38:24,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:38:24,996 INFO L87 Difference]: Start difference. First operand 18 states and 45 transitions. Second operand 4 states. [2019-01-31 17:38:26,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:38:26,020 INFO L93 Difference]: Finished difference Result 31 states and 74 transitions. [2019-01-31 17:38:26,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:38:26,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-31 17:38:26,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:38:26,021 INFO L225 Difference]: With dead ends: 31 [2019-01-31 17:38:26,021 INFO L226 Difference]: Without dead ends: 29 [2019-01-31 17:38:26,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-31 17:38:26,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-31 17:38:26,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2019-01-31 17:38:26,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-31 17:38:26,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2019-01-31 17:38:26,051 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 56 transitions. Word has length 4 [2019-01-31 17:38:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:38:26,052 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 56 transitions. [2019-01-31 17:38:26,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-31 17:38:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 56 transitions. [2019-01-31 17:38:26,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:38:26,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:38:26,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:38:26,053 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:38:26,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:26,053 INFO L82 PathProgramCache]: Analyzing trace with hash 937490, now seen corresponding path program 1 times [2019-01-31 17:38:26,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:38:26,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:26,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:38:26,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:38:26,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:38:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:38:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:38:26,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:38:26,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:38:26,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:38:26,206 INFO L207 CegarAbsIntRunner]: [0], [14], [16], [19] [2019-01-31 17:38:26,208 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:38:26,208 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:38:39,934 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:38:39,934 INFO L272 AbstractInterpreter]: Visited 4 different actions 31 times. Merged at 2 different actions 9 times. Widened at 2 different actions 5 times. Found 11 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:38:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:38:39,934 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:38:40,893 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-31 17:38:40,893 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:38:53,520 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1137 Int) (v_idx_1136 Int) (v_idx_1142 Int) (v_idx_1141 Int) (v_idx_1140 Int) (v_idx_1139 Int) (v_idx_1138 Int)) (let ((.cse56 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse0 (+ c_ULTIMATE.start_main_p1 1)) (.cse6 (<= .cse56 c_ULTIMATE.start_main_p4))) (and (or (< v_idx_1136 c_ULTIMATE.start_main_p1) (= 0 (select |c_#memory_int| v_idx_1136)) (<= .cse0 v_idx_1136)) (let ((.cse52 (select |c_#memory_int| v_idx_1142)) (.cse42 (+ c_ULTIMATE.start_main_p1 2)) (.cse54 (+ v_idx_1138 3)) (.cse55 (+ v_idx_1141 1)) (.cse53 (+ v_idx_1139 2))) (let ((.cse34 (<= (+ v_idx_1140 1) v_idx_1139)) (.cse31 (<= (+ v_idx_1140 2) c_ULTIMATE.start_main_p4)) (.cse49 (<= .cse53 v_idx_1140)) (.cse47 (<= .cse56 v_idx_1140)) (.cse48 (<= .cse55 v_idx_1140)) (.cse50 (<= .cse54 v_idx_1140)) (.cse10 (<= .cse42 v_idx_1139)) (.cse17 (<= (+ v_idx_1138 2) v_idx_1139)) (.cse41 (<= v_idx_1141 v_idx_1139)) (.cse40 (<= .cse55 c_ULTIMATE.start_main_p4)) (.cse39 (<= c_ULTIMATE.start_main_p4 v_idx_1141)) (.cse15 (<= .cse54 c_ULTIMATE.start_main_p4)) (.cse8 (<= .cse53 c_ULTIMATE.start_main_p4)) (.cse43 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_1142)) (.cse44 (< v_idx_1142 c_ULTIMATE.start_main_p4)) (.cse45 (<= .cse52 0)) (.cse51 (select |c_#memory_int| v_idx_1140)) (.cse46 (<= (* 2 .cse52) 0))) (let ((.cse2 (or .cse43 .cse44 (and .cse45 (<= .cse52 .cse51) .cse46))) (.cse19 (or (and .cse15 .cse40 .cse6 .cse8) (and .cse15 .cse39 .cse6 .cse8) (and .cse15 .cse6 .cse8))) (.cse20 (or (and .cse15 .cse40 .cse6) (and .cse15 .cse6) (and .cse15 .cse39 .cse6))) (.cse18 (or (and .cse15 .cse10 .cse17 .cse39 .cse6) (and .cse15 .cse10 .cse17 .cse6) (and .cse15 .cse10 .cse17 .cse40 .cse6 .cse41))) (.cse11 (or (and .cse10 .cse39 .cse6) (and .cse10 .cse6) (and .cse10 .cse40 .cse6 .cse41))) (.cse4 (or (and .cse40 .cse6 .cse8) (and .cse39 .cse6 .cse8) (and .cse6 .cse8))) (.cse9 (or (and .cse39 .cse6) (and .cse40 .cse6) .cse6)) (.cse3 (<= 0 (* 2 .cse51))) (.cse21 (<= 0 .cse51)) (.cse27 (or (and .cse15 .cse10 .cse17 .cse47 .cse39 .cse50 .cse6) (and .cse15 .cse10 .cse17 .cse47 .cse50 .cse6) (and .cse15 .cse10 .cse17 .cse47 .cse40 .cse48 .cse50 .cse6 .cse41))) (.cse28 (or (and .cse15 .cse47 .cse39 .cse49 .cse50 .cse6 .cse8) (and .cse15 .cse47 .cse40 .cse48 .cse49 .cse50 .cse6 .cse8) (and .cse15 .cse47 .cse49 .cse50 .cse6 .cse8))) (.cse29 (or (and .cse15 .cse47 .cse39 .cse50 .cse6) (and .cse15 .cse47 .cse40 .cse48 .cse50 .cse6) (and .cse15 .cse47 .cse50 .cse6))) (.cse24 (or (and .cse10 .cse47 .cse39 .cse6) (and .cse10 .cse47 .cse40 .cse48 .cse6 .cse41) (and .cse10 .cse47 .cse6))) (.cse25 (or (and .cse47 .cse49 .cse6 .cse8) (and .cse47 .cse39 .cse49 .cse6 .cse8) (and .cse47 .cse40 .cse48 .cse49 .cse6 .cse8))) (.cse26 (or (and .cse47 .cse6) (and .cse47 .cse39 .cse6) (and .cse47 .cse40 .cse48 .cse6))) (.cse30 (or .cse43 .cse44 (and .cse45 .cse46))) (.cse12 (= 0 (select |c_#memory_int| v_idx_1138))) (.cse35 (or (and .cse10 .cse34 .cse31 .cse39 .cse6) (and .cse10 .cse34 .cse31 .cse40 .cse6 .cse41) (and .cse10 .cse34 .cse31 .cse6))) (.cse32 (or (and .cse31 .cse40 .cse6 .cse8) (and .cse31 .cse6 .cse8) (and .cse31 .cse39 .cse6 .cse8))) (.cse14 (<= (+ v_idx_1139 1) v_idx_1138)) (.cse33 (or (and .cse31 .cse40 .cse6) (and .cse31 .cse39 .cse6) (and .cse31 .cse6))) (.cse13 (<= .cse42 v_idx_1138)) (.cse36 (or (and .cse15 .cse10 .cse34 .cse31 .cse17 .cse6) (and .cse15 .cse10 .cse34 .cse31 .cse17 .cse40 .cse6 .cse41) (and .cse15 .cse10 .cse34 .cse31 .cse17 .cse39 .cse6))) (.cse37 (or (and .cse15 .cse31 .cse39 .cse6) (and .cse15 .cse31 .cse6) (and .cse15 .cse31 .cse40 .cse6))) (.cse38 (or (and .cse15 .cse31 .cse39 .cse6 .cse8) (and .cse15 .cse31 .cse6 .cse8) (and .cse15 .cse31 .cse40 .cse6 .cse8)))) (let ((.cse1 (and .cse30 (or (and (or (and .cse10 .cse34 .cse31 .cse35 .cse6) (and .cse31 .cse32 .cse6 .cse8) (and .cse33 .cse31 .cse6)) .cse6 .cse12) (and (or (and .cse10 .cse34 .cse13 .cse31 .cse35 .cse6) (and .cse13 .cse31 .cse32 .cse6 .cse8 .cse14) (and .cse33 .cse13 .cse31 .cse6)) .cse6) (and .cse15 (or (and .cse15 .cse10 .cse36 .cse34 .cse31 .cse17 .cse6) (and .cse15 .cse37 .cse31 .cse6) (and .cse38 .cse15 .cse31 .cse6 .cse8)) .cse6)))) (.cse22 (and .cse30 (or (and .cse15 (or (and .cse15 .cse10 .cse17 .cse6 .cse27) (and .cse15 .cse6 .cse8 .cse28) (and .cse15 .cse29 .cse6)) .cse6) (and (or (and .cse25 .cse6 .cse8) (and .cse10 .cse24 .cse6) (and .cse6 .cse26)) .cse6 .cse12) (and (or (and .cse10 .cse13 .cse24 .cse6) (and .cse13 .cse25 .cse6 .cse8 .cse14) (and .cse13 .cse6 .cse26)) .cse6)))) (.cse16 (<= (+ v_idx_1138 1) v_idx_1137)) (.cse5 (<= v_idx_1139 v_idx_1137)) (.cse7 (<= .cse0 v_idx_1137)) (.cse23 (and .cse2 (or (and (or (and .cse6 .cse9) (and .cse4 .cse6 .cse8) (and .cse10 .cse6 .cse11)) .cse6 .cse12) (and .cse15 (or (and .cse15 .cse19 .cse6 .cse8) (and .cse15 .cse20 .cse6) (and .cse15 .cse10 .cse17 .cse18 .cse6)) .cse6) (and (or (and .cse10 .cse13 .cse6 .cse11) (and .cse4 .cse13 .cse6 .cse8 .cse14) (and .cse13 .cse6 .cse9)) .cse6)) .cse3 .cse21))) (or .cse1 (and .cse2 .cse3 (or (and (or (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse9) (and .cse10 .cse6 .cse7 .cse11)) .cse6 .cse12 .cse7) (and (or (and .cse10 .cse13 .cse6 .cse7 .cse11) (and .cse4 .cse5 .cse13 .cse6 .cse7 .cse8 .cse14) (and .cse13 .cse6 .cse7 .cse9)) .cse6 .cse7) (and .cse15 .cse16 .cse6 .cse7 (or (and .cse15 .cse10 .cse17 .cse16 .cse18 .cse6 .cse7) (and .cse15 .cse19 .cse5 .cse16 .cse6 .cse7 .cse8) (and .cse15 .cse20 .cse16 .cse6 .cse7)))) .cse21) (and (< v_idx_1137 .cse0) (or .cse1 .cse22 .cse23)) .cse22 (and (or (and (or (and .cse10 .cse24 .cse6 .cse7) (and .cse5 .cse25 .cse6 .cse7 .cse8) (and .cse6 .cse7 .cse26)) .cse6 .cse12 .cse7) (and .cse15 (or (and .cse15 .cse10 .cse17 .cse16 .cse6 .cse7 .cse27) (and .cse15 .cse5 .cse16 .cse6 .cse7 .cse8 .cse28) (and .cse15 .cse29 .cse16 .cse6 .cse7)) .cse16 .cse6 .cse7) (and (or (and .cse10 .cse13 .cse24 .cse6 .cse7) (and .cse13 .cse6 .cse7 .cse26) (and .cse5 .cse13 .cse25 .cse6 .cse7 .cse8 .cse14)) .cse6 .cse7)) .cse30) (and .cse30 (or (and (or (and .cse5 .cse31 .cse32 .cse6 .cse7 .cse8) (and .cse33 .cse31 .cse6 .cse7) (and .cse10 .cse34 .cse31 .cse35 .cse6 .cse7)) .cse6 .cse12 .cse7) (and .cse15 (or (and .cse15 .cse10 .cse36 .cse34 .cse31 .cse17 .cse16 .cse6 .cse7) (and .cse15 .cse37 .cse31 .cse16 .cse6 .cse7) (and .cse38 .cse15 .cse5 .cse31 .cse16 .cse6 .cse7 .cse8)) .cse16 .cse6 .cse7) (and (or (and .cse5 .cse13 .cse31 .cse32 .cse6 .cse7 .cse8 .cse14) (and .cse10 .cse34 .cse13 .cse31 .cse35 .cse6 .cse7) (and .cse33 .cse13 .cse31 .cse6 .cse7)) .cse6 .cse7))) .cse23))))) .cse6)))) is different from false [2019-01-31 17:38:54,078 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:38:54,079 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:38:54,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:38:54,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-31 17:38:54,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:38:54,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:38:54,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:38:54,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=7, Unknown=1, NotChecked=4, Total=20 [2019-01-31 17:38:54,080 INFO L87 Difference]: Start difference. First operand 21 states and 56 transitions. Second operand 5 states. [2019-01-31 17:41:02,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:02,691 INFO L93 Difference]: Finished difference Result 35 states and 81 transitions. [2019-01-31 17:41:02,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-31 17:41:02,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:41:02,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:02,692 INFO L225 Difference]: With dead ends: 35 [2019-01-31 17:41:02,692 INFO L226 Difference]: Without dead ends: 34 [2019-01-31 17:41:02,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=12, Invalid=10, Unknown=2, NotChecked=6, Total=30 [2019-01-31 17:41:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-31 17:41:02,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 23. [2019-01-31 17:41:02,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-31 17:41:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-31 17:41:02,734 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 4 [2019-01-31 17:41:02,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:02,735 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-31 17:41:02,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:41:02,735 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-31 17:41:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:41:02,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:02,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:41:02,736 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash 937616, now seen corresponding path program 1 times [2019-01-31 17:41:02,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:02,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:02,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:02,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:02,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:02,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:02,789 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:41:02,789 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [21] [2019-01-31 17:41:02,790 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:02,790 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:07,078 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:41:07,079 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:41:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:07,079 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:41:08,038 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-31 17:41:08,038 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:41:08,691 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:41:08,691 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:41:08,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:41:08,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 5 [2019-01-31 17:41:08,692 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:41:08,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:41:08,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:41:08,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:41:08,692 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 5 states. [2019-01-31 17:41:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:09,807 INFO L93 Difference]: Finished difference Result 39 states and 93 transitions. [2019-01-31 17:41:09,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-31 17:41:09,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:41:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:09,808 INFO L225 Difference]: With dead ends: 39 [2019-01-31 17:41:09,808 INFO L226 Difference]: Without dead ends: 37 [2019-01-31 17:41:09,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:41:09,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-31 17:41:09,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-01-31 17:41:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-31 17:41:09,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 78 transitions. [2019-01-31 17:41:09,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 78 transitions. Word has length 4 [2019-01-31 17:41:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:09,857 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 78 transitions. [2019-01-31 17:41:09,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:41:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 78 transitions. [2019-01-31 17:41:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-31 17:41:09,857 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:09,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-31 17:41:09,858 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 937304, now seen corresponding path program 1 times [2019-01-31 17:41:09,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:09,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:09,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:09,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:09,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:09,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:09,964 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-31 17:41:09,964 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [19] [2019-01-31 17:41:09,966 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:09,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:21,544 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:41:21,544 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 2 different actions 8 times. Widened at 2 different actions 4 times. Found 10 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-31 17:41:21,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:21,545 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:41:22,541 INFO L227 lantSequenceWeakener]: Weakened 3 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-31 17:41:22,541 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:41:22,972 INFO L420 sIntCurrentIteration]: We unified 3 AI predicates to 3 [2019-01-31 17:41:22,972 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:41:22,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:41:22,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 6 [2019-01-31 17:41:22,973 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:41:22,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-31 17:41:22,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-31 17:41:22,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:41:22,973 INFO L87 Difference]: Start difference. First operand 27 states and 78 transitions. Second operand 5 states. [2019-01-31 17:41:24,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:24,052 INFO L93 Difference]: Finished difference Result 38 states and 96 transitions. [2019-01-31 17:41:24,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-31 17:41:24,053 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2019-01-31 17:41:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:24,053 INFO L225 Difference]: With dead ends: 38 [2019-01-31 17:41:24,053 INFO L226 Difference]: Without dead ends: 33 [2019-01-31 17:41:24,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-31 17:41:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-31 17:41:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2019-01-31 17:41:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-31 17:41:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2019-01-31 17:41:24,117 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 87 transitions. Word has length 4 [2019-01-31 17:41:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:24,117 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 87 transitions. [2019-01-31 17:41:24,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-31 17:41:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 87 transitions. [2019-01-31 17:41:24,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:41:24,117 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:24,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:41:24,118 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:24,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:24,118 INFO L82 PathProgramCache]: Analyzing trace with hash 29125732, now seen corresponding path program 1 times [2019-01-31 17:41:24,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:24,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:24,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:24,119 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:24,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:24,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:24,171 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:41:24,171 INFO L207 CegarAbsIntRunner]: [0], [16], [20], [22], [23] [2019-01-31 17:41:24,172 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:24,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:41:33,559 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:41:33,559 INFO L272 AbstractInterpreter]: Visited 5 different actions 21 times. Merged at 3 different actions 12 times. Widened at 1 different actions 2 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-31 17:41:33,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:33,559 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:41:34,590 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 56.25% of their original sizes. [2019-01-31 17:41:34,590 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:41:35,422 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-31 17:41:35,422 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:41:35,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:41:35,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [2] total 6 [2019-01-31 17:41:35,423 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:41:35,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:41:35,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:41:35,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:41:35,424 INFO L87 Difference]: Start difference. First operand 29 states and 87 transitions. Second operand 6 states. [2019-01-31 17:41:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-31 17:41:37,382 INFO L93 Difference]: Finished difference Result 51 states and 131 transitions. [2019-01-31 17:41:37,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-31 17:41:37,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-31 17:41:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-31 17:41:37,383 INFO L225 Difference]: With dead ends: 51 [2019-01-31 17:41:37,383 INFO L226 Difference]: Without dead ends: 42 [2019-01-31 17:41:37,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-31 17:41:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-31 17:41:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-01-31 17:41:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-31 17:41:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 111 transitions. [2019-01-31 17:41:37,452 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 111 transitions. Word has length 5 [2019-01-31 17:41:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-31 17:41:37,452 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 111 transitions. [2019-01-31 17:41:37,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-31 17:41:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 111 transitions. [2019-01-31 17:41:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-31 17:41:37,453 INFO L394 BasicCegarLoop]: Found error trace [2019-01-31 17:41:37,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-31 17:41:37,453 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-01-31 17:41:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:41:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 29111902, now seen corresponding path program 1 times [2019-01-31 17:41:37,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-31 17:41:37,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:37,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-31 17:41:37,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-31 17:41:37,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-31 17:41:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-31 17:41:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-31 17:41:37,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-31 17:41:37,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-31 17:41:37,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-31 17:41:37,595 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [16], [19] [2019-01-31 17:41:37,596 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-31 17:41:37,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-31 17:42:03,447 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-01-31 17:42:03,447 INFO L272 AbstractInterpreter]: Visited 5 different actions 57 times. Merged at 3 different actions 13 times. Widened at 3 different actions 9 times. Found 29 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-31 17:42:03,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-31 17:42:03,448 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-01-31 17:42:04,769 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 62.5% of their original sizes. [2019-01-31 17:42:04,770 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-01-31 17:42:21,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_idx_1806 Int) (v_idx_1805 Int) (v_idx_1804 Int) (v_idx_1803 Int) (v_idx_1802 Int) (v_idx_1801 Int) (v_idx_1799 Int)) (let ((.cse53 (+ c_ULTIMATE.start_main_p1 1))) (and (let ((.cse51 (select |c_#memory_int| v_idx_1801)) (.cse35 (+ c_ULTIMATE.start_main_p2 1))) (let ((.cse39 (<= .cse35 v_idx_1801)) (.cse42 (<= .cse51 0)) (.cse43 (<= (* 2 .cse51) 0)) (.cse40 (< v_idx_1801 c_ULTIMATE.start_main_p2)) (.cse46 (select |c_#memory_int| v_idx_1799))) (let ((.cse50 (< v_idx_1799 c_ULTIMATE.start_main_p1)) (.cse45 (<= 0 .cse46)) (.cse41 (<= .cse51 .cse46)) (.cse47 (<= 0 (* 2 .cse46))) (.cse52 (or .cse39 (and .cse42 .cse43) .cse40)) (.cse49 (<= .cse53 v_idx_1799))) (let ((.cse2 (and .cse52 .cse49)) (.cse4 (and .cse45 (or .cse39 .cse40 (and .cse41 .cse42 .cse43)) .cse47)) (.cse5 (and .cse52 .cse50)) (.cse36 (+ c_ULTIMATE.start_main_p1 3)) (.cse37 (+ c_ULTIMATE.start_main_p2 2)) (.cse38 (select |c_#memory_int| v_idx_1805))) (let ((.cse29 (<= (* 2 .cse38) 0)) (.cse30 (let ((.cse44 (<= (+ .cse51 .cse38) 0))) (let ((.cse48 (or .cse39 .cse40 (and .cse42 .cse43 .cse44)))) (or (and (or .cse39 .cse40 (and .cse41 .cse42 .cse43 .cse44)) .cse45 (<= .cse38 .cse46) .cse47) (and .cse48 .cse49) (and .cse48 .cse50))))) (.cse31 (<= .cse38 0)) (.cse16 (<= (+ v_idx_1803 2) v_idx_1804)) (.cse9 (<= (+ v_idx_1803 3) v_idx_1805)) (.cse19 (= 0 (select |c_#memory_int| v_idx_1803))) (.cse32 (<= v_idx_1806 v_idx_1804)) (.cse17 (<= .cse37 v_idx_1804)) (.cse18 (<= .cse36 v_idx_1804)) (.cse15 (<= (+ v_idx_1804 2) v_idx_1805)) (.cse34 (<= (+ v_idx_1806 1) v_idx_1805)) (.cse7 (or .cse2 .cse4 .cse5)) (.cse11 (<= (+ c_ULTIMATE.start_main_p1 4) v_idx_1805)) (.cse13 (<= (+ c_ULTIMATE.start_main_p2 3) v_idx_1805)) (.cse10 (<= (+ v_idx_1803 1) v_idx_1802)) (.cse8 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_1802)) (.cse20 (<= .cse37 v_idx_1803)) (.cse21 (<= (+ v_idx_1804 1) v_idx_1803)) (.cse14 (<= v_idx_1804 v_idx_1802)) (.cse22 (<= .cse36 v_idx_1803)) (.cse12 (<= .cse35 v_idx_1802))) (let ((.cse0 (< v_idx_1802 .cse35)) (.cse25 (and .cse8 .cse20 .cse21 .cse14 .cse22 .cse12)) (.cse26 (and .cse8 .cse20 .cse22 .cse12)) (.cse27 (and .cse8 .cse14 .cse12)) (.cse28 (and .cse8 .cse12)) (.cse33 (<= (+ v_idx_1805 1) v_idx_1804)) (.cse23 (and .cse8 .cse10 .cse14 .cse12)) (.cse24 (and .cse8 .cse10 .cse12)) (.cse1 (and (or (and (or (and .cse20 .cse34 .cse21 .cse22 .cse11 .cse13 .cse15) (and .cse20 .cse34 .cse22 .cse11 .cse13) (and .cse32 .cse20 .cse34 .cse17 .cse18 .cse22 .cse11 .cse13)) .cse11 .cse13) (and (or (and .cse34 .cse9 .cse11 .cse13 .cse15) (and .cse34 .cse9 .cse11 .cse13) (and .cse32 .cse16 .cse34 .cse17 .cse9 .cse18 .cse11 .cse13)) .cse9 .cse11 .cse13) (and .cse19 (or (and .cse32 .cse34 .cse17 .cse18 .cse11 .cse13) (and .cse34 .cse11 .cse13 .cse15) (and .cse34 .cse11 .cse13)) .cse11 .cse13)) .cse34 .cse7 .cse11 .cse13)) (.cse3 (and .cse29 .cse30 .cse31)) (.cse6 (and (or (and (or (and .cse20 .cse21 .cse22 .cse11 .cse13 .cse15) (and .cse20 .cse17 .cse18 .cse22 .cse11 .cse13) (and .cse20 .cse22 .cse11 .cse13)) .cse11 .cse13) (and (or (and .cse16 .cse17 .cse9 .cse18 .cse11 .cse13) (and .cse9 .cse11 .cse13) (and .cse9 .cse11 .cse13 .cse15)) .cse9 .cse11 .cse13) (and .cse19 .cse11 (or (and .cse11 .cse13 .cse15) (and .cse11 .cse13) (and .cse17 .cse18 .cse11 .cse13)) .cse13)) .cse7 .cse11 .cse13))) (or (and .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) (and .cse0 (or .cse2 .cse3 .cse4 .cse6 .cse5)) (and .cse7 (or (and .cse8 (or (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 (or (and .cse8 .cse14 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse17 .cse18 .cse11 .cse12 .cse13) (and .cse8 .cse11 .cse12 .cse13)) .cse19 .cse11 .cse12 .cse13) (and .cse8 (or (and .cse8 .cse20 .cse21 .cse14 .cse22 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse20 .cse22 .cse11 .cse12 .cse13) (and .cse8 .cse20 .cse17 .cse18 .cse22 .cse11 .cse12 .cse13)) .cse11 .cse12 .cse13)) .cse11 .cse13) (and (or (and .cse8 (or .cse23 .cse24 (and .cse8 .cse16 .cse17 .cse10 .cse18 .cse12)) .cse10 .cse12) (and (or .cse25 .cse26 (and .cse8 .cse20 .cse17 .cse18 .cse22 .cse12)) .cse8 .cse12) (and (or (and .cse8 .cse17 .cse18 .cse12) .cse27 .cse28) .cse8 .cse19 .cse12)) .cse29 .cse30 .cse31) (and (or (and .cse8 (or .cse25 .cse26 (and .cse32 .cse8 .cse20 .cse17 .cse18 .cse22 .cse12)) .cse12) (and .cse8 (or .cse27 (and .cse32 .cse8 .cse17 .cse18 .cse12) .cse28) .cse19 .cse12) (and .cse8 .cse10 .cse12 (or (and .cse32 .cse8 .cse16 .cse17 .cse10 .cse18 .cse12) .cse23 .cse24))) .cse29 .cse30 .cse31) (and (or (and .cse8 (or .cse25 .cse26 (and .cse8 .cse20 .cse17 .cse18 .cse22 .cse12 .cse33)) .cse12) (and .cse8 .cse19 (or .cse27 .cse28 (and .cse8 .cse17 .cse18 .cse12 .cse33)) .cse12) (and (or .cse23 .cse24 (and .cse8 .cse16 .cse17 .cse10 .cse18 .cse12 .cse33)) .cse8 .cse10 .cse12)) .cse7) (and (or (and .cse8 (or .cse25 .cse26 (and .cse32 .cse8 .cse20 .cse17 .cse18 .cse22 .cse12 .cse33)) .cse12) (and .cse8 (or (and .cse32 .cse8 .cse17 .cse18 .cse12 .cse33) .cse27 .cse28) .cse19 .cse12) (and .cse8 .cse10 (or (and .cse32 .cse8 .cse16 .cse17 .cse10 .cse18 .cse12 .cse33) .cse23 .cse24) .cse12)) .cse7) .cse4 .cse5 (and .cse34 (or (and .cse8 .cse19 (or (and .cse8 .cse34 .cse14 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse34 .cse11 .cse12 .cse13) (and .cse32 .cse8 .cse34 .cse17 .cse18 .cse11 .cse12 .cse13)) .cse11 .cse12 .cse13) (and .cse8 (or (and .cse32 .cse8 .cse16 .cse34 .cse17 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13) (and .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse34 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse15)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse11 (or (and .cse8 .cse20 .cse34 .cse21 .cse14 .cse22 .cse11 .cse12 .cse13 .cse15) (and .cse32 .cse8 .cse20 .cse34 .cse17 .cse18 .cse22 .cse11 .cse12 .cse13) (and .cse8 .cse20 .cse34 .cse22 .cse11 .cse12 .cse13)) .cse12 .cse13)) .cse7 .cse11 .cse13) .cse1 .cse2 .cse3 .cse6))))))) (<= .cse53 c_ULTIMATE.start_main_p2)))) is different from false [2019-01-31 17:42:36,912 INFO L420 sIntCurrentIteration]: We unified 4 AI predicates to 4 [2019-01-31 17:42:36,912 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-01-31 17:42:36,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-31 17:42:36,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2019-01-31 17:42:36,913 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-31 17:42:36,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-31 17:42:36,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-31 17:42:36,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=10, Unknown=2, NotChecked=6, Total=30 [2019-01-31 17:42:36,913 INFO L87 Difference]: Start difference. First operand 35 states and 111 transitions. Second operand 6 states. [2019-01-31 17:42:48,630 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_idx_1806 Int) (v_idx_1805 Int) (v_idx_1804 Int) (v_idx_1803 Int) (v_idx_1802 Int) (v_idx_1801 Int) (v_idx_1799 Int)) (let ((.cse53 (+ c_ULTIMATE.start_main_p1 1))) (and (let ((.cse51 (select |c_#memory_int| v_idx_1801)) (.cse35 (+ c_ULTIMATE.start_main_p2 1))) (let ((.cse39 (<= .cse35 v_idx_1801)) (.cse42 (<= .cse51 0)) (.cse43 (<= (* 2 .cse51) 0)) (.cse40 (< v_idx_1801 c_ULTIMATE.start_main_p2)) (.cse46 (select |c_#memory_int| v_idx_1799))) (let ((.cse50 (< v_idx_1799 c_ULTIMATE.start_main_p1)) (.cse45 (<= 0 .cse46)) (.cse41 (<= .cse51 .cse46)) (.cse47 (<= 0 (* 2 .cse46))) (.cse52 (or .cse39 (and .cse42 .cse43) .cse40)) (.cse49 (<= .cse53 v_idx_1799))) (let ((.cse2 (and .cse52 .cse49)) (.cse4 (and .cse45 (or .cse39 .cse40 (and .cse41 .cse42 .cse43)) .cse47)) (.cse5 (and .cse52 .cse50)) (.cse36 (+ c_ULTIMATE.start_main_p1 3)) (.cse37 (+ c_ULTIMATE.start_main_p2 2)) (.cse38 (select |c_#memory_int| v_idx_1805))) (let ((.cse29 (<= (* 2 .cse38) 0)) (.cse30 (let ((.cse44 (<= (+ .cse51 .cse38) 0))) (let ((.cse48 (or .cse39 .cse40 (and .cse42 .cse43 .cse44)))) (or (and (or .cse39 .cse40 (and .cse41 .cse42 .cse43 .cse44)) .cse45 (<= .cse38 .cse46) .cse47) (and .cse48 .cse49) (and .cse48 .cse50))))) (.cse31 (<= .cse38 0)) (.cse16 (<= (+ v_idx_1803 2) v_idx_1804)) (.cse9 (<= (+ v_idx_1803 3) v_idx_1805)) (.cse19 (= 0 (select |c_#memory_int| v_idx_1803))) (.cse32 (<= v_idx_1806 v_idx_1804)) (.cse17 (<= .cse37 v_idx_1804)) (.cse18 (<= .cse36 v_idx_1804)) (.cse15 (<= (+ v_idx_1804 2) v_idx_1805)) (.cse34 (<= (+ v_idx_1806 1) v_idx_1805)) (.cse7 (or .cse2 .cse4 .cse5)) (.cse11 (<= (+ c_ULTIMATE.start_main_p1 4) v_idx_1805)) (.cse13 (<= (+ c_ULTIMATE.start_main_p2 3) v_idx_1805)) (.cse10 (<= (+ v_idx_1803 1) v_idx_1802)) (.cse8 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_1802)) (.cse20 (<= .cse37 v_idx_1803)) (.cse21 (<= (+ v_idx_1804 1) v_idx_1803)) (.cse14 (<= v_idx_1804 v_idx_1802)) (.cse22 (<= .cse36 v_idx_1803)) (.cse12 (<= .cse35 v_idx_1802))) (let ((.cse0 (< v_idx_1802 .cse35)) (.cse25 (and .cse8 .cse20 .cse21 .cse14 .cse22 .cse12)) (.cse26 (and .cse8 .cse20 .cse22 .cse12)) (.cse27 (and .cse8 .cse14 .cse12)) (.cse28 (and .cse8 .cse12)) (.cse33 (<= (+ v_idx_1805 1) v_idx_1804)) (.cse23 (and .cse8 .cse10 .cse14 .cse12)) (.cse24 (and .cse8 .cse10 .cse12)) (.cse1 (and (or (and (or (and .cse20 .cse34 .cse21 .cse22 .cse11 .cse13 .cse15) (and .cse20 .cse34 .cse22 .cse11 .cse13) (and .cse32 .cse20 .cse34 .cse17 .cse18 .cse22 .cse11 .cse13)) .cse11 .cse13) (and (or (and .cse34 .cse9 .cse11 .cse13 .cse15) (and .cse34 .cse9 .cse11 .cse13) (and .cse32 .cse16 .cse34 .cse17 .cse9 .cse18 .cse11 .cse13)) .cse9 .cse11 .cse13) (and .cse19 (or (and .cse32 .cse34 .cse17 .cse18 .cse11 .cse13) (and .cse34 .cse11 .cse13 .cse15) (and .cse34 .cse11 .cse13)) .cse11 .cse13)) .cse34 .cse7 .cse11 .cse13)) (.cse3 (and .cse29 .cse30 .cse31)) (.cse6 (and (or (and (or (and .cse20 .cse21 .cse22 .cse11 .cse13 .cse15) (and .cse20 .cse17 .cse18 .cse22 .cse11 .cse13) (and .cse20 .cse22 .cse11 .cse13)) .cse11 .cse13) (and (or (and .cse16 .cse17 .cse9 .cse18 .cse11 .cse13) (and .cse9 .cse11 .cse13) (and .cse9 .cse11 .cse13 .cse15)) .cse9 .cse11 .cse13) (and .cse19 .cse11 (or (and .cse11 .cse13 .cse15) (and .cse11 .cse13) (and .cse17 .cse18 .cse11 .cse13)) .cse13)) .cse7 .cse11 .cse13))) (or (and .cse0 (or .cse1 .cse2 .cse3 .cse4 .cse5)) (and .cse0 (or .cse2 .cse3 .cse4 .cse6 .cse5)) (and .cse7 (or (and .cse8 (or (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse16 .cse17 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 (or (and .cse8 .cse14 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse17 .cse18 .cse11 .cse12 .cse13) (and .cse8 .cse11 .cse12 .cse13)) .cse19 .cse11 .cse12 .cse13) (and .cse8 (or (and .cse8 .cse20 .cse21 .cse14 .cse22 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse20 .cse22 .cse11 .cse12 .cse13) (and .cse8 .cse20 .cse17 .cse18 .cse22 .cse11 .cse12 .cse13)) .cse11 .cse12 .cse13)) .cse11 .cse13) (and (or (and .cse8 (or .cse23 .cse24 (and .cse8 .cse16 .cse17 .cse10 .cse18 .cse12)) .cse10 .cse12) (and (or .cse25 .cse26 (and .cse8 .cse20 .cse17 .cse18 .cse22 .cse12)) .cse8 .cse12) (and (or (and .cse8 .cse17 .cse18 .cse12) .cse27 .cse28) .cse8 .cse19 .cse12)) .cse29 .cse30 .cse31) (and (or (and .cse8 (or .cse25 .cse26 (and .cse32 .cse8 .cse20 .cse17 .cse18 .cse22 .cse12)) .cse12) (and .cse8 (or .cse27 (and .cse32 .cse8 .cse17 .cse18 .cse12) .cse28) .cse19 .cse12) (and .cse8 .cse10 .cse12 (or (and .cse32 .cse8 .cse16 .cse17 .cse10 .cse18 .cse12) .cse23 .cse24))) .cse29 .cse30 .cse31) (and (or (and .cse8 (or .cse25 .cse26 (and .cse8 .cse20 .cse17 .cse18 .cse22 .cse12 .cse33)) .cse12) (and .cse8 .cse19 (or .cse27 .cse28 (and .cse8 .cse17 .cse18 .cse12 .cse33)) .cse12) (and (or .cse23 .cse24 (and .cse8 .cse16 .cse17 .cse10 .cse18 .cse12 .cse33)) .cse8 .cse10 .cse12)) .cse7) (and (or (and .cse8 (or .cse25 .cse26 (and .cse32 .cse8 .cse20 .cse17 .cse18 .cse22 .cse12 .cse33)) .cse12) (and .cse8 (or (and .cse32 .cse8 .cse17 .cse18 .cse12 .cse33) .cse27 .cse28) .cse19 .cse12) (and .cse8 .cse10 (or (and .cse32 .cse8 .cse16 .cse17 .cse10 .cse18 .cse12 .cse33) .cse23 .cse24) .cse12)) .cse7) .cse4 .cse5 (and .cse34 (or (and .cse8 .cse19 (or (and .cse8 .cse34 .cse14 .cse11 .cse12 .cse13 .cse15) (and .cse8 .cse34 .cse11 .cse12 .cse13) (and .cse32 .cse8 .cse34 .cse17 .cse18 .cse11 .cse12 .cse13)) .cse11 .cse12 .cse13) (and .cse8 (or (and .cse32 .cse8 .cse16 .cse34 .cse17 .cse9 .cse10 .cse18 .cse11 .cse12 .cse13) (and .cse8 .cse34 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse34 .cse9 .cse10 .cse14 .cse11 .cse12 .cse13 .cse15)) .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse8 .cse11 (or (and .cse8 .cse20 .cse34 .cse21 .cse14 .cse22 .cse11 .cse12 .cse13 .cse15) (and .cse32 .cse8 .cse20 .cse34 .cse17 .cse18 .cse22 .cse11 .cse12 .cse13) (and .cse8 .cse20 .cse34 .cse22 .cse11 .cse12 .cse13)) .cse12 .cse13)) .cse7 .cse11 .cse13) .cse1 .cse2 .cse3 .cse6))))))) (<= .cse53 c_ULTIMATE.start_main_p2)))) (forall ((v_idx_1796 Int) (v_idx_1795 Int) (v_idx_1794 Int) (v_idx_1793 Int) (v_idx_1792 Int) (v_idx_1790 Int)) (let ((.cse96 (+ c_ULTIMATE.start_main_p2 2)) (.cse97 (+ c_ULTIMATE.start_main_p1 3))) (let ((.cse54 (+ c_ULTIMATE.start_main_p1 1)) (.cse71 (+ c_ULTIMATE.start_main_p2 1)) (.cse76 (<= .cse97 c_ULTIMATE.start_main_p4)) (.cse80 (<= .cse96 c_ULTIMATE.start_main_p4))) (and (let ((.cse62 (select |c_#memory_int| v_idx_1796)) (.cse69 (select |c_#memory_int| v_idx_1792))) (let ((.cse68 (<= (+ c_ULTIMATE.start_main_p4 1) v_idx_1796)) (.cse67 (< v_idx_1796 c_ULTIMATE.start_main_p4)) (.cse58 (<= (+ .cse62 .cse69) 0)) (.cse64 (<= .cse62 0)) (.cse65 (<= (* 2 .cse62) 0)) (.cse60 (<= .cse71 v_idx_1792)) (.cse61 (< v_idx_1792 c_ULTIMATE.start_main_p2)) (.cse57 (<= (* 2 .cse69) 0)) (.cse59 (<= .cse69 0))) (let ((.cse55 (let ((.cse70 (or .cse60 .cse61 (and .cse57 .cse59)))) (or (and .cse68 .cse70) (and .cse67 .cse70) (and (or (and .cse57 .cse58 .cse59) .cse60 .cse61) .cse64 .cse65))))) (or (and (<= .cse54 v_idx_1790) .cse55) (let ((.cse63 (select |c_#memory_int| v_idx_1790))) (and (let ((.cse56 (<= .cse69 .cse63))) (let ((.cse66 (or .cse60 .cse61 (and .cse56 .cse57 .cse59)))) (or (and (or (and .cse56 .cse57 .cse58 .cse59) .cse60 .cse61) (<= .cse62 .cse63) .cse64 .cse65) (and .cse66 .cse67) (and .cse66 .cse68)))) (<= 0 (* 2 .cse63)) (<= 0 .cse63))) (and (< v_idx_1790 c_ULTIMATE.start_main_p1) .cse55))))) (<= .cse54 c_ULTIMATE.start_main_p2) (let ((.cse93 (<= (+ v_idx_1794 2) c_ULTIMATE.start_main_p4)) (.cse73 (<= .cse97 v_idx_1794)) (.cse74 (<= .cse96 v_idx_1794)) (.cse90 (= (select |c_#memory_int| v_idx_1794) 0)) (.cse95 (+ v_idx_1795 1))) (let ((.cse78 (<= .cse95 v_idx_1794)) (.cse75 (<= .cse95 c_ULTIMATE.start_main_p4)) (.cse94 (<= (+ v_idx_1794 1) v_idx_1793)) (.cse77 (<= (+ c_ULTIMATE.start_main_p1 2) v_idx_1793)) (.cse79 (<= .cse71 v_idx_1793)) (.cse91 (< v_idx_1793 .cse71)) (.cse81 (and .cse90 .cse76 .cse80)) (.cse82 (and .cse73 .cse74 .cse76 .cse80)) (.cse84 (and .cse93 .cse76 .cse80))) (let ((.cse83 (and .cse91 (or .cse81 .cse82 .cse84))) (.cse85 (and .cse90 .cse76 .cse77 .cse79 .cse80)) (.cse86 (and .cse73 .cse74 .cse76 .cse77 .cse79 .cse80)) (.cse87 (and .cse93 .cse94 .cse76 .cse77 .cse79 .cse80)) (.cse88 (and .cse93 .cse75 .cse76 .cse80)) (.cse89 (and .cse73 .cse74 .cse75 .cse76 .cse78 .cse80)) (.cse72 (<= v_idx_1795 v_idx_1793)) (.cse92 (and .cse75 .cse90 .cse76 .cse80))) (or (and .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80) (and (or .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87) (<= c_ULTIMATE.start_main_p4 v_idx_1795)) .cse81 .cse88 .cse82 .cse83 .cse84 .cse85 .cse89 .cse86 .cse87 (and .cse72 .cse75 .cse90 .cse76 .cse77 .cse79 .cse80) (and .cse91 (or .cse88 .cse89 .cse92)) (and .cse93 .cse72 .cse94 .cse75 .cse76 .cse77 .cse79 .cse80) .cse92)))) .cse76 .cse80))))) is different from false