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-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:51:23,836 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:51:23,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:51:23,851 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:51:23,851 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:51:23,852 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:51:23,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:51:23,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:51:23,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:51:23,870 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:51:23,871 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:51:23,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:51:23,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:51:23,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:51:23,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:51:23,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:51:23,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:51:23,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:51:23,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:51:23,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:51:23,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:51:23,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:51:23,893 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:51:23,893 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:51:23,893 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:51:23,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:51:23,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:51:23,896 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:51:23,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:51:23,899 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:51:23,900 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:51:23,901 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:51:23,901 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:51:23,902 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:51:23,902 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:51:23,905 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:51:23,905 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-02-25 15:51:23,929 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:51:23,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:51:23,930 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:51:23,930 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:51:23,931 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:51:23,931 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:51:23,931 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:51:23,931 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:51:23,931 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:51:23,932 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:51:23,932 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:51:23,932 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:51:23,932 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:51:23,933 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:51:23,933 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:51:23,933 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:51:23,934 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:51:23,935 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:51:23,935 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:51:23,935 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:51:23,935 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:51:23,936 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:51:23,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:51:23,936 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:51:23,936 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:51:23,936 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:51:23,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:51:23,938 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:51:23,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:51:23,938 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:51:23,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:51:23,939 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:51:23,939 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:51:23,939 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:51:23,939 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:51:23,939 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:51:23,940 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:51:23,940 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:51:23,940 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:51:23,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:51:24,010 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:51:24,016 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:51:24,018 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:51:24,019 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:51:24,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl [2019-02-25 15:51:24,020 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-02-25 15:51:24,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:51:24,068 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:51:24,069 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:24,069 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:51:24,069 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:51:24,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:51:24,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:51:24,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:51:24,137 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:51:24,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... [2019-02-25 15:51:24,162 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:51:24,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:51:24,163 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:51:24,163 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:51:24,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:51:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:51:24,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:51:24,430 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:51:24,430 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-25 15:51:24,432 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:24 BoogieIcfgContainer [2019-02-25 15:51:24,432 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:51:24,434 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:51:24,434 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:51:24,437 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:51:24,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:51:24" (1/2) ... [2019-02-25 15:51:24,439 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2093b3b and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:51:24, skipping insertion in model container [2019-02-25 15:51:24,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:51:24" (2/2) ... [2019-02-25 15:51:24,441 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-02-25 15:51:24,450 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:51:24,457 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-25 15:51:24,471 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-25 15:51:24,501 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:51:24,502 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:51:24,502 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:51:24,502 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:51:24,502 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:51:24,502 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:51:24,503 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:51:24,503 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:51:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-25 15:51:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-25 15:51:24,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:24,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-25 15:51:24,526 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:24,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:24,533 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-25 15:51:24,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:24,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:24,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:24,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:24,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:24,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:24,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:24,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:51:24,714 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:24,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:51:24,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:51:24,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:51:24,731 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-25 15:51:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:24,879 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-25 15:51:24,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:24,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-25 15:51:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:24,897 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:51:24,897 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:51:24,901 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-02-25 15:51:24,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:51:24,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-25 15:51:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:51:24,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-25 15:51:24,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-25 15:51:24,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:24,967 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-25 15:51:24,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:51:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-25 15:51:24,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:24,968 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:24,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:24,968 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:24,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-25 15:51:24,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:24,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:24,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:25,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:25,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:25,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:25,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:25,092 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-25 15:51:25,149 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:25,149 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:26,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:26,076 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:51:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:26,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:26,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:26,084 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-02-25 15:51:26,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:26,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:26,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:51:26,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:26,244 INFO L467 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 9 treesize of output 12 [2019-02-25 15:51:26,290 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:51:26,291 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:26,363 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:26,408 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:26,409 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-25 15:51:26,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:26,449 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:51:26,450 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:26,457 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:26,457 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:51:26,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:26,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:26,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:51:26,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-25 15:51:26,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:26,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:26,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:26,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:51:26,552 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-25 15:51:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:26,665 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-02-25 15:51:26,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:51:26,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-25 15:51:26,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:26,666 INFO L225 Difference]: With dead ends: 10 [2019-02-25 15:51:26,666 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:51:26,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:51:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:51:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-02-25 15:51:26,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:51:26,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-02-25 15:51:26,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-02-25 15:51:26,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:26,672 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-02-25 15:51:26,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:51:26,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-02-25 15:51:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:51:26,673 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:26,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:51:26,674 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-25 15:51:26,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:26,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:26,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:26,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:26,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:26,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:26,761 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:26,761 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-25 15:51:26,761 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-25 15:51:26,763 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:26,763 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:29,739 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:29,740 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 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-02-25 15:51:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:29,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:29,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:29,741 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:29,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:29,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:29,767 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:51:29,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:29,778 INFO L467 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 9 treesize of output 12 [2019-02-25 15:51:29,787 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:29,788 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:51:29,788 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:29,872 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:30,001 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:51:30,001 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:30,027 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:30,059 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:30,060 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-25 15:51:30,089 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:30,090 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:51:30,091 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:30,102 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:30,103 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2019-02-25 15:51:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:30,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:30,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:30,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:30,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:51:30,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:30,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:51:30,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:51:30,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:51:30,208 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-02-25 15:51:30,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:30,432 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-25 15:51:30,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:51:30,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-25 15:51:30,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:30,433 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:51:30,433 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:51:30,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-25 15:51:30,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:51:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-02-25 15:51:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:51:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-02-25 15:51:30,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-02-25 15:51:30,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:30,439 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-02-25 15:51:30,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:51:30,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-02-25 15:51:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:30,439 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:30,439 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:30,440 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:30,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:30,440 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-25 15:51:30,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:30,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:30,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:30,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:30,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:30,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:30,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:30,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:30,505 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:30,506 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-25 15:51:30,507 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:30,507 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:30,925 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:30,925 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:30,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:30,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:30,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:30,926 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:30,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:30,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:30,959 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:51:30,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:30,995 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:51:30,995 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,001 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,010 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2019-02-25 15:51:31,015 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:51:31,016 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,025 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,033 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,034 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-25 15:51:31,066 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:31,067 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:51:31,067 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,072 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,073 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-25 15:51:31,112 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:31,113 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:31,117 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:31,118 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:51:31,119 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:31,125 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:31,126 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-02-25 15:51:31,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:31,138 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:31,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:31,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:31,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:31,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:31,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:31,481 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-02-25 15:51:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:31,723 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-02-25 15:51:31,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:51:31,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-25 15:51:31,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:31,725 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:51:31,725 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:51:31,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:51:31,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:51:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-02-25 15:51:31,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:51:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-25 15:51:31,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-02-25 15:51:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:31,729 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-25 15:51:31,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-25 15:51:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:51:31,730 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:31,730 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:51:31,730 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:31,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:31,730 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-02-25 15:51:31,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:31,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:31,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:31,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:31,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:31,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:31,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:51:31,765 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-02-25 15:51:31,766 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:31,767 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:33,698 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:33,699 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-02-25 15:51:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:33,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:33,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:33,699 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:33,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:33,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:33,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:51:33,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:33,717 INFO L467 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 9 treesize of output 12 [2019-02-25 15:51:33,724 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-02-25 15:51:33,724 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:33,732 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:33,745 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:33,745 INFO L208 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-25 15:51:33,760 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:33,761 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-25 15:51:33,761 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:33,770 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:33,770 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-25 15:51:33,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:33,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:33,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-25 15:51:33,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-25 15:51:33,837 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:33,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:33,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:33,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:51:33,838 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-25 15:51:33,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:33,888 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-02-25 15:51:33,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:51:33,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:51:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:33,889 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:51:33,890 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:51:33,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-25 15:51:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:51:33,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-02-25 15:51:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:51:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-02-25 15:51:33,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-02-25 15:51:33,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:33,895 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-02-25 15:51:33,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:51:33,895 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-02-25 15:51:33,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:51:33,896 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:33,896 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:51:33,896 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:33,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:33,897 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-02-25 15:51:33,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:33,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:33,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:33,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:33,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-25 15:51:33,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:51:33,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:51:33,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:51:33,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:51:33,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:51:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-25 15:51:33,959 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-02-25 15:51:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:33,988 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-02-25 15:51:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:51:33,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-25 15:51:33,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:33,989 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:51:33,989 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:51:33,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-25 15:51:33,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:51:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:51:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:51:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-25 15:51:33,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-02-25 15:51:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:33,995 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-02-25 15:51:33,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:51:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-25 15:51:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:51:33,996 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:51:33,996 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-25 15:51:33,996 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:51:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:33,996 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-02-25 15:51:33,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:51:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:33,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:33,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:51:33,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:51:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:34,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:34,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:51:34,075 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-25 15:51:34,075 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-02-25 15:51:34,076 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:51:34,076 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:51:34,341 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:51:34,342 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-25 15:51:34,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:51:34,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:51:34,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:51:34,342 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:51:34,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:51:34,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:51:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:51:34,365 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:51:34,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:51:34,381 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-02-25 15:51:34,382 INFO L301 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,384 INFO L301 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,398 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 9 treesize of output 12 [2019-02-25 15:51:34,401 INFO L467 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-02-25 15:51:34,402 INFO L301 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,413 INFO L301 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,424 INFO L301 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,424 INFO L208 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-25 15:51:34,448 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:34,449 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-25 15:51:34,449 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,456 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,456 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-25 15:51:34,468 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:34,470 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:34,488 INFO L176 IndexEqualityManager]: detected not equals via solver [2019-02-25 15:51:34,489 INFO L467 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2019-02-25 15:51:34,489 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:51:34,496 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-25 15:51:34,496 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-25 15:51:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:34,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:51:34,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:51:34,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:51:34,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:51:34,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:51:34,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:51:34,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:51:34,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:51:34,592 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2019-02-25 15:51:34,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:51:34,697 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-02-25 15:51:34,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:51:34,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-25 15:51:34,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:51:34,699 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:51:34,699 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:51:34,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:51:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:51:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:51:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:51:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:51:34,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-25 15:51:34,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:51:34,701 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:51:34,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:51:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:51:34,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:51:34,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:51:35,062 WARN L181 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-02-25 15:51:35,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-25 15:51:35,065 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-02-25 15:51:35,065 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-25 15:51:35,066 INFO L444 ceAbstractionStarter]: At program point L24-1(lines 23 29) the Hoare annotation is: (let ((.cse2 (select |#memory_int| ULTIMATE.start_main_p1))) (let ((.cse0 (let ((.cse3 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ (select |#memory_int| ULTIMATE.start_main_p2) (- 1))) ULTIMATE.start_main_p1))) (or (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 1 .cse3)) (and (= .cse2 0) (= 0 .cse3))))) (.cse1 (select (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse2 1)) ULTIMATE.start_main_p2))) (or (and .cse0 (= 0 .cse1)) (and .cse0 (<= (+ .cse1 1) 0))))) [2019-02-25 15:51:35,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-02-25 15:51:35,066 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-02-25 15:51:35,066 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-02-25 15:51:35,080 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:51:35 BoogieIcfgContainer [2019-02-25 15:51:35,081 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:51:35,082 INFO L168 Benchmark]: Toolchain (without parser) took 11015.02 ms. Allocated memory was 134.2 MB in the beginning and 588.8 MB in the end (delta: 454.6 MB). Free memory was 108.2 MB in the beginning and 481.3 MB in the end (delta: -373.1 MB). Peak memory consumption was 81.4 MB. Max. memory is 7.1 GB. [2019-02-25 15:51:35,083 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 134.2 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:51:35,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.42 ms. Allocated memory is still 134.2 MB. Free memory was 108.2 MB in the beginning and 106.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:51:35,085 INFO L168 Benchmark]: Boogie Preprocessor took 25.99 ms. Allocated memory is still 134.2 MB. Free memory was 106.0 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-25 15:51:35,085 INFO L168 Benchmark]: RCFGBuilder took 269.48 ms. Allocated memory is still 134.2 MB. Free memory was 104.7 MB in the beginning and 95.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-02-25 15:51:35,086 INFO L168 Benchmark]: TraceAbstraction took 10647.75 ms. Allocated memory was 134.2 MB in the beginning and 588.8 MB in the end (delta: 454.6 MB). Free memory was 95.3 MB in the beginning and 481.3 MB in the end (delta: -386.0 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. [2019-02-25 15:51:35,093 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 134.2 MB. Free memory is still 109.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.42 ms. Allocated memory is still 134.2 MB. Free memory was 108.2 MB in the beginning and 106.0 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.99 ms. Allocated memory is still 134.2 MB. Free memory was 106.0 MB in the beginning and 104.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 269.48 ms. Allocated memory is still 134.2 MB. Free memory was 104.7 MB in the beginning and 95.5 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10647.75 ms. Allocated memory was 134.2 MB in the beginning and 588.8 MB in the end (delta: 454.6 MB). Free memory was 95.3 MB in the beginning and 481.3 MB in the end (delta: -386.0 MB). Peak memory consumption was 68.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 32]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) || (((!(p1 == p2) && 1 <= #memory_int[p2 := #memory_int[p2] + -1][p1]) || (#memory_int[p1] == 0 && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1])) && #memory_int[p1 := #memory_int[p1] + 1][p2] + 1 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 2 error locations. SAFE Result, 10.5s OverallTime, 7 OverallIterations, 2 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 13 SDtfs, 31 SDslu, 1 SDs, 0 SdLazy, 175 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.5s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 19 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 8 NumberOfFragments, 101 HoareAnnotationTreeSize, 1 FomulaSimplifications, 594 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 561 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 45 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 47 ConstructedInterpolants, 4 QuantifiedInterpolants, 1521 SizeOfPredicates, 11 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 17 InterpolantComputations, 4 PerfectInterpolantSequences, 9/30 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...