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_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:21:59,866 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:21:59,868 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:21:59,881 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:21:59,882 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:21:59,886 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:21:59,887 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:21:59,889 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:21:59,892 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:21:59,894 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:21:59,897 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:21:59,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:21:59,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:21:59,899 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:21:59,902 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:21:59,902 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:21:59,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:21:59,906 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:21:59,908 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:21:59,910 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:21:59,914 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:21:59,915 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:21:59,918 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:21:59,919 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:21:59,919 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:21:59,920 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:21:59,922 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:21:59,923 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:21:59,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:21:59,927 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:21:59,927 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:21:59,929 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:21:59,930 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:21:59,930 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:21:59,931 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:21:59,932 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:21:59,932 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-28 10:21:59,959 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:21:59,959 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:21:59,961 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:21:59,962 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:21:59,962 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:21:59,962 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:21:59,962 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:21:59,962 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:21:59,963 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:21:59,963 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:21:59,963 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:21:59,963 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:21:59,964 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:21:59,964 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:21:59,964 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:21:59,965 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:21:59,965 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:21:59,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:21:59,965 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:21:59,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:21:59,967 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:21:59,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:21:59,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:21:59,968 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:21:59,968 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:21:59,968 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:21:59,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:21:59,969 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:21:59,969 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:21:59,969 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:21:59,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:21:59,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:21:59,970 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:21:59,970 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:21:59,970 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:21:59,970 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:21:59,971 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:21:59,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:21:59,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:21:59,972 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:22:00,010 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:22:00,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:22:00,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:22:00,026 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:22:00,026 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:22:00,027 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-28 10:22:00,027 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-2-unlimited.bpl' [2019-02-28 10:22:00,060 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:22:00,061 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:22:00,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:00,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:22:00,062 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:22:00,079 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,090 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,117 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:22:00,118 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:22:00,118 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:22:00,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:22:00,130 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,130 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,131 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,132 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,135 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,140 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,140 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 28.02 10:22:00" (1/1) ... [2019-02-28 10:22:00,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:22:00,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:22:00,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:22:00,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:22:00,144 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 28.02 10:22:00" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:22:00,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:22:00,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:22:00,395 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:22:00,396 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-02-28 10:22:00,397 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:22:00 BoogieIcfgContainer [2019-02-28 10:22:00,397 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:22:00,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:22:00,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:22:00,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:22:00,402 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 28.02 10:22:00" (1/2) ... [2019-02-28 10:22:00,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5237d7be and model type speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:22:00, skipping insertion in model container [2019-02-28 10:22:00,403 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 28.02 10:22:00" (2/2) ... [2019-02-28 10:22:00,405 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-2-unlimited.bpl [2019-02-28 10:22:00,415 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:22:00,422 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-02-28 10:22:00,439 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-02-28 10:22:00,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:22:00,470 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:22:00,470 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:22:00,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:22:00,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:22:00,471 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:22:00,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:22:00,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:22:00,487 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-28 10:22:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-28 10:22:00,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:00,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-28 10:22:00,497 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:00,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:00,504 INFO L82 PathProgramCache]: Analyzing trace with hash 972, now seen corresponding path program 1 times [2019-02-28 10:22:00,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:00,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:00,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:00,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:00,664 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-28 10:22:00,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:00,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-28 10:22:00,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:00,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:22:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:22:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:22:00,683 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-28 10:22:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:00,871 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2019-02-28 10:22:00,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:00,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-28 10:22:00,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:00,889 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:22:00,889 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:22:00,892 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-28 10:22:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:22:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-02-28 10:22:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:22:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 10:22:00,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 2 [2019-02-28 10:22:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:00,924 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-28 10:22:00,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:22:00,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-28 10:22:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:00,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:00,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:00,925 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash 29988, now seen corresponding path program 1 times [2019-02-28 10:22:00,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:00,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:00,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:00,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:00,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:01,038 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-28 10:22:01,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:01,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:01,040 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:01,042 INFO L207 CegarAbsIntRunner]: [0], [6], [11] [2019-02-28 10:22:01,081 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:01,081 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:01,151 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:01,152 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 2. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:01,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:01,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:01,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:01,160 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-28 10:22:01,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:01,180 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:01,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:22:01,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:01,308 INFO L442 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-28 10:22:01,462 INFO L442 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 10:22:01,464 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:01,496 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:01,525 INFO L315 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-28 10:22:01,526 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-28 10:22:01,544 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-02-28 10:22:01,545 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:01,549 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:01,550 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-28 10:22:01,587 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-28 10:22:01,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:01,642 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-28 10:22:01,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-02-28 10:22:01,665 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:01,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:01,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:22:01,667 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-28 10:22:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:01,748 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2019-02-28 10:22:01,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:22:01,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-28 10:22:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:01,749 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:22:01,749 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:22:01,750 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-28 10:22:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:22:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7. [2019-02-28 10:22:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:22:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2019-02-28 10:22:01,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 13 transitions. Word has length 3 [2019-02-28 10:22:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:01,754 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 13 transitions. [2019-02-28 10:22:01,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 13 transitions. [2019-02-28 10:22:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:22:01,754 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:01,754 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:22:01,755 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:01,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:01,755 INFO L82 PathProgramCache]: Analyzing trace with hash 30050, now seen corresponding path program 1 times [2019-02-28 10:22:01,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:01,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:01,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:01,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:01,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:01,883 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-28 10:22:01,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:01,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:01,884 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-28 10:22:01,884 INFO L207 CegarAbsIntRunner]: [0], [8], [11] [2019-02-28 10:22:01,885 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:01,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:01,890 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:01,890 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 2. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:01,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:01,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:01,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:01,891 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-28 10:22:01,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:01,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:01,912 WARN L254 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:22:01,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:01,920 INFO L442 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-28 10:22:01,963 INFO L187 IndexEqualityManager]: detected not equals via solver [2019-02-28 10:22:01,964 INFO L442 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 11 [2019-02-28 10:22:01,966 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,044 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,157 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:22:02,157 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,161 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,181 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,182 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 10:22:02,233 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:22:02,234 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,243 INFO L315 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-28 10:22:02,244 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:13 [2019-02-28 10:22:02,298 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-28 10:22:02,298 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:02,324 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-28 10:22:02,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:02,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-28 10:22:02,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:02,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:22:02,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:22:02,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:22:02,344 INFO L87 Difference]: Start difference. First operand 7 states and 13 transitions. Second operand 6 states. [2019-02-28 10:22:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:02,579 INFO L93 Difference]: Finished difference Result 17 states and 27 transitions. [2019-02-28 10:22:02,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:22:02,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-28 10:22:02,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:02,581 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:22:02,581 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:22:02,581 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-28 10:22:02,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:22:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 10. [2019-02-28 10:22:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:22:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2019-02-28 10:22:02,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 21 transitions. Word has length 3 [2019-02-28 10:22:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:02,586 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 21 transitions. [2019-02-28 10:22:02,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:22:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 21 transitions. [2019-02-28 10:22:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:02,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:02,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:02,588 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:02,588 INFO L82 PathProgramCache]: Analyzing trace with hash 929546, now seen corresponding path program 1 times [2019-02-28 10:22:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:02,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:02,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:02,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:02,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:02,661 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-28 10:22:02,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:02,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:02,661 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:02,662 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [11] [2019-02-28 10:22:02,663 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:02,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:02,667 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:02,668 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 2. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:02,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:02,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:02,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:02,668 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-28 10:22:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:02,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:02,683 WARN L254 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:22:02,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:02,703 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:22:02,703 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,706 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,715 INFO L442 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-28 10:22:02,722 INFO L442 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 11 [2019-02-28 10:22:02,723 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,733 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,742 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,742 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 10:22:02,766 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:22:02,767 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,810 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,811 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-28 10:22:02,863 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 23 [2019-02-28 10:22:02,865 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:02,873 INFO L315 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-28 10:22:02,873 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-02-28 10:22:02,908 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-28 10:22:02,908 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:03,263 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-28 10:22:03,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:03,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:03,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:03,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:03,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:03,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:03,285 INFO L87 Difference]: Start difference. First operand 10 states and 21 transitions. Second operand 8 states. [2019-02-28 10:22:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:03,487 INFO L93 Difference]: Finished difference Result 18 states and 31 transitions. [2019-02-28 10:22:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:03,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-28 10:22:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:03,488 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:22:03,488 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:22:03,489 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-28 10:22:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:22:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 6. [2019-02-28 10:22:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:22:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 9 transitions. [2019-02-28 10:22:03,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 9 transitions. Word has length 4 [2019-02-28 10:22:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:03,493 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 9 transitions. [2019-02-28 10:22:03,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 9 transitions. [2019-02-28 10:22:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:22:03,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:03,494 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:22:03,495 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:03,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 931594, now seen corresponding path program 1 times [2019-02-28 10:22:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:03,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:03,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:03,531 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-28 10:22:03,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:03,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:03,531 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:22:03,532 INFO L207 CegarAbsIntRunner]: [0], [8], [12], [13] [2019-02-28 10:22:03,533 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:03,533 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:03,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:03,540 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 2. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-28 10:22:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:03,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:03,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:03,541 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-28 10:22:03,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:03,550 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:03,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:22:03,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:03,559 INFO L442 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-28 10:22:03,579 INFO L442 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 14 [2019-02-28 10:22:03,580 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:03,588 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:03,602 INFO L315 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-28 10:22:03,603 INFO L209 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-02-28 10:22:03,613 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2019-02-28 10:22:03,615 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:03,624 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:03,625 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-02-28 10:22:03,656 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-28 10:22:03,657 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:03,781 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-28 10:22:03,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-28 10:22:03,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-28 10:22:03,800 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:03,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:03,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:03,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:22:03,801 INFO L87 Difference]: Start difference. First operand 6 states and 9 transitions. Second operand 4 states. [2019-02-28 10:22:03,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:03,834 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-02-28 10:22:03,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:22:03,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:22:03,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:03,836 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:22:03,836 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:22:03,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-28 10:22:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:22:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2019-02-28 10:22:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:22:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 14 transitions. [2019-02-28 10:22:03,842 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 14 transitions. Word has length 4 [2019-02-28 10:22:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:03,842 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 14 transitions. [2019-02-28 10:22:03,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 14 transitions. [2019-02-28 10:22:03,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:03,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:03,843 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:22:03,843 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:03,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:03,843 INFO L82 PathProgramCache]: Analyzing trace with hash 28814048, now seen corresponding path program 1 times [2019-02-28 10:22:03,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:03,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:03,897 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-28 10:22:03,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:22:03,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:22:03,898 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:22:03,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:22:03,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:22:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-28 10:22:03,900 INFO L87 Difference]: Start difference. First operand 8 states and 14 transitions. Second operand 4 states. [2019-02-28 10:22:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:03,962 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-02-28 10:22:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:22:03,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-28 10:22:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:03,963 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:22:03,963 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:22:03,964 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-28 10:22:03,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:22:03,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:22:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:22:03,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 16 transitions. [2019-02-28 10:22:03,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 16 transitions. Word has length 5 [2019-02-28 10:22:03,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:03,969 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 16 transitions. [2019-02-28 10:22:03,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:22:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 16 transitions. [2019-02-28 10:22:03,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:22:03,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:03,970 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-28 10:22:03,970 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:03,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:03,971 INFO L82 PathProgramCache]: Analyzing trace with hash 28873630, now seen corresponding path program 1 times [2019-02-28 10:22:03,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:03,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:03,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:04,044 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-28 10:22:04,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:04,045 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:04,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-28 10:22:04,045 INFO L207 CegarAbsIntRunner]: [0], [6], [8], [12], [13] [2019-02-28 10:22:04,047 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:22:04,047 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:22:04,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:22:04,051 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 28 root evaluator evaluations with a maximum evaluation depth of 2. Performed 28 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:22:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:04,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:22:04,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:04,052 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-28 10:22:04,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:04,061 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:04,066 WARN L254 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:22:04,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:04,078 INFO L442 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-02-28 10:22:04,078 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,081 INFO L315 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,090 INFO L442 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-28 10:22:04,095 INFO L442 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 11 [2019-02-28 10:22:04,096 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,107 INFO L315 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,116 INFO L315 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,117 INFO L209 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:18, output treesize:15 [2019-02-28 10:22:04,144 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2019-02-28 10:22:04,145 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,155 INFO L315 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,155 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:13 [2019-02-28 10:22:04,243 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 25 [2019-02-28 10:22:04,244 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 10:22:04,251 INFO L315 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-28 10:22:04,251 INFO L209 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-28 10:22:04,272 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-28 10:22:04,273 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:04,314 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-28 10:22:04,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:04,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-28 10:22:04,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:04,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:22:04,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:22:04,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-28 10:22:04,336 INFO L87 Difference]: Start difference. First operand 9 states and 16 transitions. Second operand 8 states. [2019-02-28 10:22:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:04,440 INFO L93 Difference]: Finished difference Result 12 states and 22 transitions. [2019-02-28 10:22:04,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:22:04,441 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-28 10:22:04,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:04,442 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:22:04,442 INFO L226 Difference]: Without dead ends: 0 [2019-02-28 10:22:04,442 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-28 10:22:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-28 10:22:04,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-28 10:22:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-28 10:22:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-28 10:22:04,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2019-02-28 10:22:04,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:04,443 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-28 10:22:04,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:22:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-28 10:22:04,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 10:22:04,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-28 10:22:04,795 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 28 [2019-02-28 10:22:04,798 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:22:04,798 INFO L448 ceAbstractionStarter]: For program point L32(line 32) no Hoare annotation was computed. [2019-02-28 10:22:04,799 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-02-28 10:22:04,799 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-28 10:22:04,799 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 32) no Hoare annotation was computed. [2019-02-28 10:22:04,799 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 34) no Hoare annotation was computed. [2019-02-28 10:22:04,799 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) no Hoare annotation was computed. [2019-02-28 10:22:04,811 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-2-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.02 10:22:04 BoogieIcfgContainer [2019-02-28 10:22:04,811 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-28 10:22:04,812 INFO L168 Benchmark]: Toolchain (without parser) took 4751.72 ms. Allocated memory was 141.0 MB in the beginning and 221.8 MB in the end (delta: 80.7 MB). Free memory was 107.5 MB in the beginning and 135.6 MB in the end (delta: -28.1 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:04,813 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 10:22:04,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 105.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:04,815 INFO L168 Benchmark]: Boogie Preprocessor took 23.72 ms. Allocated memory is still 141.0 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:04,815 INFO L168 Benchmark]: RCFGBuilder took 255.01 ms. Allocated memory is still 141.0 MB. Free memory was 104.1 MB in the beginning and 94.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:04,816 INFO L168 Benchmark]: TraceAbstraction took 4413.07 ms. Allocated memory was 141.0 MB in the beginning and 221.8 MB in the end (delta: 80.7 MB). Free memory was 94.6 MB in the beginning and 135.6 MB in the end (delta: -40.9 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. [2019-02-28 10:22:04,820 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.18 ms. Allocated memory is still 141.0 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.87 ms. Allocated memory is still 141.0 MB. Free memory was 107.5 MB in the beginning and 105.3 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.72 ms. Allocated memory is still 141.0 MB. Free memory was 105.3 MB in the beginning and 104.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.01 ms. Allocated memory is still 141.0 MB. Free memory was 104.1 MB in the beginning and 94.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4413.07 ms. Allocated memory was 141.0 MB in the beginning and 221.8 MB in the end (delta: 80.7 MB). Free memory was 94.6 MB in the beginning and 135.6 MB in the end (delta: -40.9 MB). Peak memory consumption was 39.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 32]: 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, 4.3s 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.3s 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, 0.1s 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.3s 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...