java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:28:22,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:28:22,248 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:28:22,261 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:28:22,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:28:22,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:28:22,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:28:22,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:28:22,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:28:22,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:28:22,270 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:28:22,272 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:28:22,273 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:28:22,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:28:22,277 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:28:22,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:28:22,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:28:22,283 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:28:22,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:28:22,295 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:28:22,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:28:22,301 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:28:22,307 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:28:22,307 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:28:22,307 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:28:22,308 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:28:22,311 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:28:22,311 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:28:22,316 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:28:22,318 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:28:22,319 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:28:22,319 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:28:22,321 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:28:22,321 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:28:22,323 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:28:22,323 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:28:22,324 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:28:22,349 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:28:22,349 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:28:22,350 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:28:22,350 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:28:22,351 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:28:22,351 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:28:22,351 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:28:22,351 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:28:22,351 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:28:22,352 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:28:22,352 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:28:22,352 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:28:22,352 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:28:22,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:28:22,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:28:22,353 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:28:22,354 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:28:22,354 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:28:22,354 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:28:22,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:28:22,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:28:22,355 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:28:22,355 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:28:22,355 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:28:22,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:28:22,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:28:22,356 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:28:22,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:28:22,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:28:22,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:28:22,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:28:22,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:28:22,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:28:22,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:28:22,357 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:28:22,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:28:22,357 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:28:22,358 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:28:22,358 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:28:22,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:28:22,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:28:22,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:28:22,424 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:28:22,424 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:28:22,425 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 17:28:22,425 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl' [2018-12-03 17:28:22,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:28:22,484 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:28:22,484 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:22,485 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:28:22,485 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:28:22,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,516 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:28:22,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:28:22,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:28:22,527 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:28:22,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/1) ... [2018-12-03 17:28:22,558 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:28:22,559 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:28:22,559 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:28:22,559 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:28:22,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (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 17:28:22,650 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 17:28:22,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:28:22,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:28:23,175 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:28:23,176 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 17:28:23,176 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:23 BoogieIcfgContainer [2018-12-03 17:28:23,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:28:23,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:28:23,178 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:28:23,181 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:28:23,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:28:22" (1/2) ... [2018-12-03 17:28:23,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47365792 and model type pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:28:23, skipping insertion in model container [2018-12-03 17:28:23,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:28:23" (2/2) ... [2018-12-03 17:28:23,184 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl [2018-12-03 17:28:23,194 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:28:23,202 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:28:23,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:28:23,263 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:28:23,263 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:28:23,263 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:28:23,263 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:28:23,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:28:23,264 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:28:23,264 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:28:23,264 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:28:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-12-03 17:28:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:28:23,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:23,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:23,309 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:23,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:23,316 INFO L82 PathProgramCache]: Analyzing trace with hash 738430141, now seen corresponding path program 1 times [2018-12-03 17:28:23,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:23,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:23,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:23,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:23,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:23,517 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 17:28:23,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:23,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:23,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:23,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:23,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:23,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:23,538 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 3 states. [2018-12-03 17:28:23,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:23,598 INFO L93 Difference]: Finished difference Result 48 states and 68 transitions. [2018-12-03 17:28:23,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:23,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 17:28:23,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:23,612 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:28:23,612 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:28:23,616 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 17:28:23,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:28:23,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-12-03 17:28:23,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:28:23,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2018-12-03 17:28:23,658 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2018-12-03 17:28:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:23,659 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2018-12-03 17:28:23,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:23,659 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2018-12-03 17:28:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:28:23,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:23,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:23,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:23,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:23,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1418488511, now seen corresponding path program 1 times [2018-12-03 17:28:23,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:23,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:23,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:23,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:23,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:23,824 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 17:28:23,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:23,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:23,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:23,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:23,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:23,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:23,832 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 3 states. [2018-12-03 17:28:24,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:24,007 INFO L93 Difference]: Finished difference Result 85 states and 121 transitions. [2018-12-03 17:28:24,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:24,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 17:28:24,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:24,012 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:28:24,012 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:28:24,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 17:28:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:28:24,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-12-03 17:28:24,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:28:24,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 76 transitions. [2018-12-03 17:28:24,039 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 76 transitions. Word has length 15 [2018-12-03 17:28:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:24,040 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 76 transitions. [2018-12-03 17:28:24,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:24,040 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2018-12-03 17:28:24,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:28:24,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:24,041 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:24,042 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:24,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:24,042 INFO L82 PathProgramCache]: Analyzing trace with hash -356518851, now seen corresponding path program 1 times [2018-12-03 17:28:24,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:24,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:24,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:24,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:24,158 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 17:28:24,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:24,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:24,161 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:24,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:24,163 INFO L87 Difference]: Start difference. First operand 55 states and 76 transitions. Second operand 4 states. [2018-12-03 17:28:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:24,295 INFO L93 Difference]: Finished difference Result 133 states and 182 transitions. [2018-12-03 17:28:24,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:24,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 17:28:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:24,305 INFO L225 Difference]: With dead ends: 133 [2018-12-03 17:28:24,305 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 17:28:24,308 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 17:28:24,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 17:28:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 63. [2018-12-03 17:28:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:28:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2018-12-03 17:28:24,357 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 15 [2018-12-03 17:28:24,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:24,360 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2018-12-03 17:28:24,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:24,360 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2018-12-03 17:28:24,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:28:24,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:24,362 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:24,365 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:24,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -356459269, now seen corresponding path program 1 times [2018-12-03 17:28:24,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:24,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:24,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:24,521 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 17:28:24,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:24,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:24,522 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:24,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:24,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:24,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:24,524 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand 4 states. [2018-12-03 17:28:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:24,700 INFO L93 Difference]: Finished difference Result 175 states and 233 transitions. [2018-12-03 17:28:24,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:24,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 17:28:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:24,703 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:28:24,703 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:28:24,704 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 17:28:24,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:28:24,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2018-12-03 17:28:24,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:28:24,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 80 transitions. [2018-12-03 17:28:24,723 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 80 transitions. Word has length 15 [2018-12-03 17:28:24,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:24,724 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 80 transitions. [2018-12-03 17:28:24,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:24,724 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2018-12-03 17:28:24,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:28:24,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:24,725 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:24,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:24,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:24,726 INFO L82 PathProgramCache]: Analyzing trace with hash 889000381, now seen corresponding path program 1 times [2018-12-03 17:28:24,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:24,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:24,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:24,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:24,791 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 17:28:24,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:24,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:28:24,792 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:24,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:24,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:24,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:24,793 INFO L87 Difference]: Start difference. First operand 63 states and 80 transitions. Second operand 3 states. [2018-12-03 17:28:24,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:24,827 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-12-03 17:28:24,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:24,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 17:28:24,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:24,829 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:28:24,829 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:28:24,830 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 17:28:24,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:28:24,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 17:28:24,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:28:24,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 82 transitions. [2018-12-03 17:28:24,846 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 82 transitions. Word has length 15 [2018-12-03 17:28:24,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:24,846 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 82 transitions. [2018-12-03 17:28:24,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:24,847 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2018-12-03 17:28:24,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:28:24,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:24,848 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:24,848 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:24,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash 139263349, now seen corresponding path program 1 times [2018-12-03 17:28:24,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:24,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:24,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:28:24,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:24,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:28:24,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:24,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:28:24,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:28:24,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:28:24,954 INFO L87 Difference]: Start difference. First operand 65 states and 82 transitions. Second operand 4 states. [2018-12-03 17:28:25,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:25,125 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2018-12-03 17:28:25,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:28:25,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-12-03 17:28:25,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:25,126 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:28:25,127 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:28:25,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 17:28:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:28:25,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-12-03 17:28:25,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:28:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2018-12-03 17:28:25,143 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 28 [2018-12-03 17:28:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:25,144 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2018-12-03 17:28:25,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:28:25,144 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2018-12-03 17:28:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:28:25,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:28:25,146 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:28:25,146 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:28:25,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:28:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1701100223, now seen corresponding path program 2 times [2018-12-03 17:28:25,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:28:25,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:28:25,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:28:25,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:28:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:28:25,244 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 17:28:25,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:28:25,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:28:25,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:28:25,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:28:25,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:28:25,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:28:25,246 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand 3 states. [2018-12-03 17:28:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:28:25,268 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2018-12-03 17:28:25,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:28:25,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 17:28:25,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:28:25,269 INFO L225 Difference]: With dead ends: 78 [2018-12-03 17:28:25,269 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:28:25,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 17:28:25,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:28:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:28:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:28:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:28:25,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2018-12-03 17:28:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:28:25,272 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:28:25,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:28:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:28:25,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:28:25,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:28:25,297 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:25,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:25,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:25,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:25,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:25,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:28:25,744 INFO L444 ceAbstractionStarter]: At program point L225(lines 225 235) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-12-03 17:28:25,745 INFO L444 ceAbstractionStarter]: At program point L275(lines 270 276) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-12-03 17:28:25,745 INFO L444 ceAbstractionStarter]: At program point L304(lines 171 304) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~62)) (and .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-12-03 17:28:25,745 INFO L444 ceAbstractionStarter]: At program point L296(lines 296 305) the Hoare annotation is: (and (<= ~r1 0) (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 |ULTIMATE.start_assert_#in~arg|) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-12-03 17:28:25,745 INFO L444 ceAbstractionStarter]: At program point L197(lines 188 198) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-12-03 17:28:25,746 INFO L444 ceAbstractionStarter]: At program point L292(lines 288 293) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 |ULTIMATE.start_assert_#in~arg|) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-12-03 17:28:25,746 INFO L444 ceAbstractionStarter]: At program point L255(lines 255 262) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1)) [2018-12-03 17:28:25,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 41 310) no Hoare annotation was computed. [2018-12-03 17:28:25,746 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 41 310) no Hoare annotation was computed. [2018-12-03 17:28:25,746 INFO L444 ceAbstractionStarter]: At program point L243(lines 234 244) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (not (= ~nomsg ~p3_new))) [2018-12-03 17:28:25,747 INFO L444 ceAbstractionStarter]: At program point L177(lines 177 189) the Hoare annotation is: (let ((.cse0 (<= ~r1 0))) (or (and .cse0 (not (= ~nomsg ~p3_old)) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_assert_~arg) (<= 1 ULTIMATE.start_check_~tmp~62)) (and .cse0 (= ~mode3 0) (<= 256 ~mode1)))) [2018-12-03 17:28:25,747 INFO L444 ceAbstractionStarter]: At program point L202(lines 202 212) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-12-03 17:28:25,747 INFO L444 ceAbstractionStarter]: At program point L264(lines 261 271) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1)) [2018-12-03 17:28:25,747 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 309) no Hoare annotation was computed. [2018-12-03 17:28:25,748 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 41 310) no Hoare annotation was computed. [2018-12-03 17:28:25,748 INFO L444 ceAbstractionStarter]: At program point L220(lines 211 221) the Hoare annotation is: (and (<= ~r1 0) (<= ~mode1 1) (= ~mode3 0)) [2018-12-03 17:28:25,748 INFO L444 ceAbstractionStarter]: At program point L282(lines 282 289) the Hoare annotation is: (and (not (= ~nomsg ~p3_old)) (<= ~r1 0) (<= ~mode1 1) (not (= 0 ULTIMATE.start_main_~c1~72)) (<= 1 ULTIMATE.start_check_~tmp~62)) [2018-12-03 17:28:25,748 INFO L444 ceAbstractionStarter]: At program point L307(lines 307 308) the Hoare annotation is: false [2018-12-03 17:28:25,764 INFO L202 PluginConnector]: Adding new model pals_lcr.3.ufo.BOUNDED-6.pals.c_13.bplTransformedIcfg_BEv2_23.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:28:25 BoogieIcfgContainer [2018-12-03 17:28:25,764 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:28:25,765 INFO L168 Benchmark]: Toolchain (without parser) took 3282.97 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 158.6 MB). Peak memory consumption was 158.6 MB. Max. memory is 7.1 GB. [2018-12-03 17:28:25,767 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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 17:28:25,768 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.88 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 17:28:25,769 INFO L168 Benchmark]: Boogie Preprocessor took 32.11 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 17:28:25,769 INFO L168 Benchmark]: RCFGBuilder took 617.31 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 17:28:25,770 INFO L168 Benchmark]: TraceAbstraction took 2587.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. [2018-12-03 17:28:25,775 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.21 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 41.88 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 32.11 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 617.31 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 2587.10 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 309]: 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: 282]: Loop Invariant Derived loop invariant: (((!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= check_~tmp~62 - InvariantResult [Line: 188]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_~arg) && 1 <= check_~tmp~62) || ((~r1 <= 0 && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 211]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: (!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1 - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_~arg) && 1 <= assert_#in~arg) && 1 <= check_~tmp~62 - InvariantResult [Line: 234]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && !(~nomsg == ~p3_new) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: ((!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1) && 1 <= check_~tmp~62 - InvariantResult [Line: 255]: Loop Invariant Derived loop invariant: (!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1 - InvariantResult [Line: 202]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (~r1 <= 0 && ~mode1 <= 1) && ~mode3 == 0 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: (((((~r1 <= 0 && !(~nomsg == ~p3_old)) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_~arg) && 1 <= check_~tmp~62) || ((~r1 <= 0 && ~mode3 == 0) && 256 <= ~mode1) - InvariantResult [Line: 288]: Loop Invariant Derived loop invariant: ((((!(~nomsg == ~p3_old) && ~r1 <= 0) && ~mode1 <= 1) && !(0 == main_~c1~72)) && 1 <= assert_#in~arg) && 1 <= check_~tmp~62 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. SAFE Result, 2.5s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 178 SDtfs, 132 SDslu, 174 SDs, 0 SdLazy, 76 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 126 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 29 NumberOfFragments, 215 HoareAnnotationTreeSize, 14 FomulaSimplifications, 672 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 14 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 144 NumberOfCodeBlocks, 144 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 5652 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 52/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...