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/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:22:00,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:22:00,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:22:00,126 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:22:00,127 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:22:00,128 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:22:00,129 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:22:00,131 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:22:00,133 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:22:00,133 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:22:00,134 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:22:00,135 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:22:00,136 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:22:00,137 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:22:00,138 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:22:00,138 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:22:00,139 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:22:00,141 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:22:00,143 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:22:00,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:22:00,146 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:22:00,147 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:22:00,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:22:00,150 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:22:00,151 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:22:00,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:22:00,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:22:00,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:22:00,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:22:00,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:22:00,156 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:22:00,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:22:00,157 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:22:00,157 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:22:00,158 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:22:00,159 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:22:00,159 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 [2018-12-03 15:22:00,174 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:22:00,174 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:22:00,175 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:22:00,175 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:22:00,175 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:22:00,175 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:22:00,176 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:22:00,176 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:22:00,176 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:22:00,176 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:22:00,176 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:22:00,178 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:22:00,179 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:22:00,179 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:22:00,179 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:22:00,180 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:22:00,180 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:22:00,180 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:22:00,180 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:22:00,181 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:22:00,181 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:22:00,181 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:22:00,181 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:22:00,181 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:22:00,181 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:22:00,184 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:22:00,184 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:22:00,184 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:22:00,184 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:22:00,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:22:00,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:22:00,185 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:22:00,186 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:00,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:22:00,186 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:22:00,186 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:22:00,186 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:22:00,187 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:22:00,187 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:22:00,187 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:22:00,187 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:22:00,245 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:22:00,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:22:00,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:22:00,267 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:22:00,267 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:22:00,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 15:22:00,268 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl' [2018-12-03 15:22:00,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:22:00,354 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:22:00,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:00,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:22:00,355 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:22:00,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:22:00,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:22:00,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:22:00,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:22:00,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/1) ... [2018-12-03 15:22:00,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:22:00,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:22:00,441 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:22:00,441 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:22:00,442 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03: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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:22:00,521 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:22:00,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:22:00,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:22:01,078 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:22:01,078 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:22:01,079 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:01 BoogieIcfgContainer [2018-12-03 15:22:01,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:22:01,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:22:01,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:22:01,083 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:22:01,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:22:00" (1/2) ... [2018-12-03 15:22:01,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d251ed and model type pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:22:01, skipping insertion in model container [2018-12-03 15:22:01,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:22:01" (2/2) ... [2018-12-03 15:22:01,087 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl [2018-12-03 15:22:01,097 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:22:01,104 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:22:01,117 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:22:01,150 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:22:01,150 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:22:01,151 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:22:01,151 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:22:01,151 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:22:01,151 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:22:01,151 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:22:01,151 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:22:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-12-03 15:22:01,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:01,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:01,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:01,177 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:01,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1823027031, now seen corresponding path program 1 times [2018-12-03 15:22:01,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:01,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:01,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:01,454 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:01,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:01,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:01,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:01,474 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 4 states. [2018-12-03 15:22:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:01,593 INFO L93 Difference]: Finished difference Result 43 states and 59 transitions. [2018-12-03 15:22:01,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:01,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:01,611 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:22:01,611 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:22:01,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:22:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:22:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 17. [2018-12-03 15:22:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:22:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2018-12-03 15:22:01,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 14 [2018-12-03 15:22:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:01,656 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2018-12-03 15:22:01,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2018-12-03 15:22:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:01,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:01,657 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:01,658 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:01,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:01,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1823086613, now seen corresponding path program 1 times [2018-12-03 15:22:01,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:01,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:01,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:01,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:01,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:22:01,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:01,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:22:01,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:22:01,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:22:01,774 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand 4 states. [2018-12-03 15:22:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:01,968 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2018-12-03 15:22:01,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:22:01,969 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 15:22:01,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:01,970 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:22:01,970 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:22:01,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:22:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:22:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2018-12-03 15:22:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:22:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-12-03 15:22:01,987 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2018-12-03 15:22:01,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:01,988 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-12-03 15:22:01,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:22:01,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2018-12-03 15:22:01,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:01,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:01,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:01,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:01,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:01,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1765828311, now seen corresponding path program 1 times [2018-12-03 15:22:01,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:01,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:02,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:02,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:02,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:02,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:02,091 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 3 states. [2018-12-03 15:22:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,120 INFO L93 Difference]: Finished difference Result 49 states and 63 transitions. [2018-12-03 15:22:02,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:02,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,123 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:22:02,124 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:22:02,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:02,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:22:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:22:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:22:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-12-03 15:22:02,146 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 14 [2018-12-03 15:22:02,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,147 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-12-03 15:22:02,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:02,147 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-12-03 15:22:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:02,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:02,149 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash 2023993749, now seen corresponding path program 1 times [2018-12-03 15:22:02,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:02,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:02,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:02,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:02,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:02,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:02,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:02,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:02,239 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 3 states. [2018-12-03 15:22:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,283 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2018-12-03 15:22:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:02,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-03 15:22:02,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,285 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:22:02,285 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:22:02,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:22:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:22:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:22:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-12-03 15:22:02,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2018-12-03 15:22:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,301 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-12-03 15:22:02,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:02,301 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2018-12-03 15:22:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:02,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,302 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:02,303 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,303 INFO L82 PathProgramCache]: Analyzing trace with hash 550402615, now seen corresponding path program 1 times [2018-12-03 15:22:02,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:02,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:02,454 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:22:02,456 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [16], [18], [22], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 15:22:02,499 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:22:02,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:22:03,512 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:22:03,514 INFO L272 AbstractInterpreter]: Visited 18 different actions 91 times. Merged at 15 different actions 56 times. Widened at 6 different actions 6 times. Found 9 fixpoints after 8 different actions. Largest state had 0 variables. [2018-12-03 15:22:03,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:03,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:22:03,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,556 INFO L192 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 [2018-12-03 15:22:03,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:03,571 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:03,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:03,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:03,745 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:22:03,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 6 [2018-12-03 15:22:03,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:03,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:03,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:03,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:22:03,746 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 3 states. [2018-12-03 15:22:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:03,787 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-12-03 15:22:03,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:03,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:22:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:03,789 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:22:03,789 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:22:03,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:22:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:22:03,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-12-03 15:22:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:22:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2018-12-03 15:22:03,803 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 26 [2018-12-03 15:22:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:03,804 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2018-12-03 15:22:03,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2018-12-03 15:22:03,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:03,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:03,805 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:03,806 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:03,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash 943429625, now seen corresponding path program 1 times [2018-12-03 15:22:03,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:03,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:04,223 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:22:04,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:04,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:04,229 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:22:04,230 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 15:22:04,236 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:22:04,236 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:22:04,639 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:22:04,639 INFO L272 AbstractInterpreter]: Visited 19 different actions 89 times. Merged at 17 different actions 50 times. Never widened. Found 15 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:22:04,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:04,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:22:04,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,678 INFO L192 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 [2018-12-03 15:22:04,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:04,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:04,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:04,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:04,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:05,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:05,048 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:22:05,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 7 [2018-12-03 15:22:05,049 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:05,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:05,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:22:05,054 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 3 states. [2018-12-03 15:22:05,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,150 INFO L93 Difference]: Finished difference Result 177 states and 222 transitions. [2018-12-03 15:22:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:05,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-03 15:22:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,157 INFO L225 Difference]: With dead ends: 177 [2018-12-03 15:22:05,157 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 15:22:05,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:22:05,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 15:22:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-12-03 15:22:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 15:22:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2018-12-03 15:22:05,197 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 26 [2018-12-03 15:22:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,198 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2018-12-03 15:22:05,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2018-12-03 15:22:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:05,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,200 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:05,200 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,201 INFO L82 PathProgramCache]: Analyzing trace with hash 134082999, now seen corresponding path program 1 times [2018-12-03 15:22:05,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,630 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:22:05,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:05,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:05,636 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:05,636 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2018-12-03 15:22:05,636 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50] [2018-12-03 15:22:05,639 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:22:05,639 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:22:06,185 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:22:06,185 INFO L272 AbstractInterpreter]: Visited 20 different actions 138 times. Merged at 19 different actions 83 times. Widened at 9 different actions 12 times. Found 30 fixpoints after 12 different actions. Largest state had 0 variables. [2018-12-03 15:22:06,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:22:06,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:06,226 INFO L192 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 [2018-12-03 15:22:06,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:06,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:06,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:22:06,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:06,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2018-12-03 15:22:06,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:06,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:22:06,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:22:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:22:06,819 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand 7 states. [2018-12-03 15:22:07,479 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:22:07,728 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:22:08,960 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-03 15:22:09,419 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-03 15:22:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,478 INFO L93 Difference]: Finished difference Result 409 states and 509 transitions. [2018-12-03 15:22:09,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:22:09,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-12-03 15:22:09,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,486 INFO L225 Difference]: With dead ends: 409 [2018-12-03 15:22:09,486 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 15:22:09,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:22:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 15:22:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 191. [2018-12-03 15:22:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 15:22:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 227 transitions. [2018-12-03 15:22:09,552 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 227 transitions. Word has length 26 [2018-12-03 15:22:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,553 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 227 transitions. [2018-12-03 15:22:09,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:22:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 227 transitions. [2018-12-03 15:22:09,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:22:09,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:09,558 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:22:09,558 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:09,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:09,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1972650023, now seen corresponding path program 2 times [2018-12-03 15:22:09,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:09,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:09,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:09,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-03 15:22:09,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:22:09,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:22:09,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:22:09,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:22:09,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:22:09,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:09,651 INFO L87 Difference]: Start difference. First operand 191 states and 227 transitions. Second operand 3 states. [2018-12-03 15:22:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,659 INFO L93 Difference]: Finished difference Result 191 states and 227 transitions. [2018-12-03 15:22:09,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:22:09,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-03 15:22:09,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,660 INFO L225 Difference]: With dead ends: 191 [2018-12-03 15:22:09,660 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:22:09,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:22:09,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:22:09,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:22:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:22:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:22:09,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-12-03 15:22:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,668 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:22:09,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:22:09,668 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:22:09,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:22:09,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:22:09,773 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:09,777 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:09,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:09,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:22:10,127 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:22:10,492 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-12-03 15:22:11,174 WARN L180 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-12-03 15:22:11,308 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 15:22:11,570 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 21 [2018-12-03 15:22:11,648 INFO L444 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1))) (.cse1 (not (= (+ ~p1_old 1) 0))) (.cse2 (<= 0 ~p1_new))) (or (and (<= 1 ~mode2) .cse0 .cse1) (and (<= ~r1 0) (= ~mode2 0) .cse0 .cse2) (and (<= ~r1 1) .cse0 .cse1 .cse2))) [2018-12-03 15:22:11,648 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 47 318) no Hoare annotation was computed. [2018-12-03 15:22:11,648 INFO L444 ceAbstractionStarter]: At program point L283(lines 279 284) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~77) (<= 1 ~mode2) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:11,649 INFO L444 ceAbstractionStarter]: At program point L240(lines 234 241) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~p1_new))) (or (and .cse0 (<= ~r1 1) .cse1 (not (= (+ ~p1_old 1) 0)) .cse2) (and (<= ~r1 0) .cse0 .cse1 .cse2))) [2018-12-03 15:22:11,649 INFO L444 ceAbstractionStarter]: At program point L304(lines 304 310) the Hoare annotation is: (and (not (= 0 ULTIMATE.start_assert_~arg)) (<= 1 ~mode2) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:11,649 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 317) no Hoare annotation was computed. [2018-12-03 15:22:11,649 INFO L444 ceAbstractionStarter]: At program point L300(lines 296 301) the Hoare annotation is: (and (<= 1 ~mode2) (not (= 0 |ULTIMATE.start_assert_#in~arg|)) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:11,650 INFO L444 ceAbstractionStarter]: At program point L199(lines 199 212) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode2) .cse0 (not (= (+ ~p1_old 1) 0))) (and (<= ~r1 0) (= ~mode2 0) (<= (+ ~mode1 256) 0) .cse0))) [2018-12-03 15:22:11,650 INFO L444 ceAbstractionStarter]: At program point L290(lines 290 297) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~77) (<= 1 ~mode2) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0)) (<= 1 ULTIMATE.start_main_~c1~84)) [2018-12-03 15:22:11,650 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 47 318) no Hoare annotation was computed. [2018-12-03 15:22:11,650 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 47 318) no Hoare annotation was computed. [2018-12-03 15:22:11,651 INFO L444 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1))) (.cse1 (not (= (+ ~p1_old 1) 0))) (.cse2 (<= 0 ~p1_new))) (or (and (<= 1 ~mode2) .cse0 .cse1) (and (<= ~r1 0) (= ~mode2 0) .cse0 .cse2) (and (<= ~r1 1) .cse0 .cse1 .cse2))) [2018-12-03 15:22:11,651 INFO L444 ceAbstractionStarter]: At program point L315(lines 193 315) the Hoare annotation is: (let ((.cse0 (= 0 (+ ~nomsg 1)))) (or (and (<= 1 ~mode2) .cse0 (not (= (+ ~p1_old 1) 0))) (and (<= ~r1 0) (= ~mode2 0) (<= (+ ~mode1 256) 0) .cse0))) [2018-12-03 15:22:11,651 INFO L444 ceAbstractionStarter]: At program point L245(lines 245 254) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~p1_new))) (or (and .cse0 (<= ~r1 1) .cse1 (not (= (+ ~p1_old 1) 0)) .cse2) (and (<= ~r1 0) .cse0 .cse1 .cse2))) [2018-12-03 15:22:11,651 INFO L444 ceAbstractionStarter]: At program point L309(lines 309 316) the Hoare annotation is: false [2018-12-03 15:22:11,652 INFO L444 ceAbstractionStarter]: At program point L272(lines 272 280) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~r1 1) (= 0 (+ ~nomsg 1)) (not (= (+ ~p1_old 1) 0))) [2018-12-03 15:22:11,652 INFO L444 ceAbstractionStarter]: At program point L260(lines 253 261) the Hoare annotation is: (let ((.cse0 (<= 1 ~mode2)) (.cse1 (= 0 (+ ~nomsg 1))) (.cse2 (<= 0 ~p1_new))) (or (and .cse0 (<= ~r1 1) .cse1 (not (= (+ ~p1_old 1) 0)) .cse2) (and (<= ~r1 0) .cse0 .cse1 .cse2))) [2018-12-03 15:22:11,667 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.1.ufo.BOUNDED-6.pals.c_9.bplTransformedIcfg_BEv2_24.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:22:11 BoogieIcfgContainer [2018-12-03 15:22:11,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:22:11,669 INFO L168 Benchmark]: Toolchain (without parser) took 11315.99 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.9 MB). Free memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: -187.4 MB). Peak memory consumption was 533.5 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:11,670 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:11,671 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:11,671 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:11,672 INFO L168 Benchmark]: RCFGBuilder took 638.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:11,673 INFO L168 Benchmark]: TraceAbstraction took 10587.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -219.1 MB). Peak memory consumption was 501.8 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:11,677 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 638.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10587.65 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 720.9 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -219.1 MB). Peak memory consumption was 501.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 317]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: ((((1 <= ~mode2 && ~r1 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && 0 <= ~p1_new) || (((~r1 <= 0 && 1 <= ~mode2) && 0 == ~nomsg + 1) && 0 <= ~p1_new) - InvariantResult [Line: 272]: Loop Invariant Derived loop invariant: ((1 <= ~mode2 && ~r1 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 279]: Loop Invariant Derived loop invariant: ((1 <= check_~tmp~77 && 1 <= ~mode2) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (((1 <= ~mode2 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && ~mode2 == 0) && 0 == ~nomsg + 1) && 0 <= ~p1_new)) || (((~r1 <= 1 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && 0 <= ~p1_new) - InvariantResult [Line: 199]: Loop Invariant Derived loop invariant: ((1 <= ~mode2 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && ~mode2 == 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 245]: Loop Invariant Derived loop invariant: ((((1 <= ~mode2 && ~r1 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && 0 <= ~p1_new) || (((~r1 <= 0 && 1 <= ~mode2) && 0 == ~nomsg + 1) && 0 <= ~p1_new) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((1 <= ~mode2 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && ~mode2 == 0) && 0 == ~nomsg + 1) && 0 <= ~p1_new)) || (((~r1 <= 1 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && 0 <= ~p1_new) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((1 <= ~mode2 && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((1 <= check_~tmp~77 && 1 <= ~mode2) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && 1 <= main_~c1~84 - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: ((1 <= ~mode2 && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) || (((~r1 <= 0 && ~mode2 == 0) && ~mode1 + 256 <= 0) && 0 == ~nomsg + 1) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: (((!(0 == assert_~arg) && 1 <= ~mode2) && !(0 == assert_#in~arg)) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0) - InvariantResult [Line: 253]: Loop Invariant Derived loop invariant: ((((1 <= ~mode2 && ~r1 <= 1) && 0 == ~nomsg + 1) && !(~p1_old + 1 == 0)) && 0 <= ~p1_new) || (((~r1 <= 0 && 1 <= ~mode2) && 0 == ~nomsg + 1) && 0 <= ~p1_new) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 10.5s OverallTime, 8 OverallIterations, 3 TraceHistogramMax, 3.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 187 SDslu, 204 SDs, 0 SdLazy, 124 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 155 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 58 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 101 NumberOfFragments, 375 HoareAnnotationTreeSize, 13 FomulaSimplifications, 1743 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 13 FomulaSimplificationsInter, 55 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 314 ConstructedInterpolants, 0 QuantifiedInterpolants, 21508 SizeOfPredicates, 1 NumberOfNonLiveVariables, 680 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 126/144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...