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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:38:30,161 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:38:30,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:38:30,183 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:38:30,184 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:38:30,186 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:38:30,187 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:38:30,189 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:38:30,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:38:30,192 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:38:30,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:38:30,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:38:30,205 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:38:30,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:38:30,207 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:38:30,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:38:30,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:38:30,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:38:30,217 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:38:30,221 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:38:30,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:38:30,226 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:38:30,229 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:38:30,229 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:38:30,230 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:38:30,231 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:38:30,231 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:38:30,232 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:38:30,233 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:38:30,234 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:38:30,234 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:38:30,235 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:38:30,235 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:38:30,235 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:38:30,236 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:38:30,237 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:38:30,237 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:38:30,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:38:30,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:38:30,250 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:38:30,250 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:38:30,251 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:38:30,251 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:38:30,251 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:38:30,251 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:38:30,251 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:38:30,252 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:38:30,252 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:38:30,252 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:38:30,252 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:38:30,252 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:38:30,253 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:38:30,253 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:38:30,254 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:38:30,254 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:38:30,254 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:38:30,254 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:38:30,254 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:38:30,255 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:38:30,255 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:38:30,255 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:38:30,255 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:38:30,255 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:38:30,256 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:38:30,256 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:38:30,256 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:38:30,256 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:38:30,257 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:38:30,257 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:38:30,258 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:38:30,258 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:38:30,258 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:38:30,258 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:38:30,258 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:38:30,259 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:38:30,259 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:38:30,259 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:38:30,259 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:38:30,296 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:38:30,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:38:30,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:38:30,319 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:38:30,320 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:38:30,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl [2018-12-03 15:38:30,321 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl' [2018-12-03 15:38:30,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:38:30,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:38:30,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:38:30,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:38:30,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:38:30,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:38:30,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:38:30,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:38:30,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:38:30,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/1) ... [2018-12-03 15:38:30,485 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:38:30,486 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:38:30,486 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:38:30,486 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:38:30,487 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (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:38:30,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:38:30,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:38:31,119 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:38:31,120 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:38:31,120 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:38:31 BoogieIcfgContainer [2018-12-03 15:38:31,120 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:38:31,121 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:38:31,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:38:31,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:38:31,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:38:30" (1/2) ... [2018-12-03 15:38:31,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2855ef6 and model type pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:38:31, skipping insertion in model container [2018-12-03 15:38:31,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:38:31" (2/2) ... [2018-12-03 15:38:31,128 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl [2018-12-03 15:38:31,138 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:38:31,145 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:38:31,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:38:31,193 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:38:31,193 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:38:31,194 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:38:31,194 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:38:31,194 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:38:31,194 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:38:31,194 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:38:31,194 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:38:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-12-03 15:38:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:38:31,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:31,216 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:31,219 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:31,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:31,224 INFO L82 PathProgramCache]: Analyzing trace with hash -100896173, now seen corresponding path program 1 times [2018-12-03 15:38:31,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:31,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:31,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:31,473 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:38:31,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:31,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:31,476 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:31,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:31,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:31,497 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-12-03 15:38:31,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:31,554 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2018-12-03 15:38:31,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:31,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 15:38:31,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:31,568 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:38:31,568 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:38:31,578 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:38:31,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:38:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-03 15:38:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:38:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2018-12-03 15:38:31,620 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2018-12-03 15:38:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:31,621 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2018-12-03 15:38:31,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:31,621 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2018-12-03 15:38:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:38:31,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:31,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:31,623 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:31,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:31,623 INFO L82 PathProgramCache]: Analyzing trace with hash -43637871, now seen corresponding path program 1 times [2018-12-03 15:38:31,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:31,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:31,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:31,780 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:38:31,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:31,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:31,781 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:31,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:31,784 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 3 states. [2018-12-03 15:38:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:31,855 INFO L93 Difference]: Finished difference Result 67 states and 91 transitions. [2018-12-03 15:38:31,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:31,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 15:38:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:31,859 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:38:31,860 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:38:31,863 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:38:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:38:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-03 15:38:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:38:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2018-12-03 15:38:31,875 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 12 [2018-12-03 15:38:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:31,875 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2018-12-03 15:38:31,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2018-12-03 15:38:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:38:31,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:31,877 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:31,877 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:31,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:31,878 INFO L82 PathProgramCache]: Analyzing trace with hash -43697453, now seen corresponding path program 1 times [2018-12-03 15:38:31,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:31,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:31,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:31,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:32,001 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:38:32,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:32,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:38:32,002 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:32,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:38:32,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:38:32,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:38:32,004 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2018-12-03 15:38:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:32,161 INFO L93 Difference]: Finished difference Result 78 states and 103 transitions. [2018-12-03 15:38:32,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:38:32,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-03 15:38:32,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:32,163 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:38:32,164 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:38:32,164 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:38:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:38:32,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 47. [2018-12-03 15:38:32,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:38:32,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-12-03 15:38:32,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 12 [2018-12-03 15:38:32,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:32,181 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-12-03 15:38:32,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:38:32,182 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-12-03 15:38:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:38:32,182 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:32,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:32,183 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:32,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:32,183 INFO L82 PathProgramCache]: Analyzing trace with hash -436664881, now seen corresponding path program 1 times [2018-12-03 15:38:32,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:32,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:32,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:32,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:32,282 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:38:32,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:32,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:32,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:32,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:32,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:32,284 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 3 states. [2018-12-03 15:38:32,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:32,346 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2018-12-03 15:38:32,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:32,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 15:38:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:32,351 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:38:32,351 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:38:32,354 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:38:32,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:38:32,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-03 15:38:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:38:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2018-12-03 15:38:32,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 12 [2018-12-03 15:38:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:32,397 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2018-12-03 15:38:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-12-03 15:38:32,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:38:32,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:32,399 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:32,399 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:32,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:32,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1645106231, now seen corresponding path program 1 times [2018-12-03 15:38:32,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:32,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:32,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:32,708 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:38:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:32,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:32,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:38:32,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:32,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:32,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:32,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:32,712 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand 3 states. [2018-12-03 15:38:32,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:32,804 INFO L93 Difference]: Finished difference Result 213 states and 273 transitions. [2018-12-03 15:38:32,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:32,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 15:38:32,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:32,811 INFO L225 Difference]: With dead ends: 213 [2018-12-03 15:38:32,811 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 15:38:32,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 15:38:32,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-12-03 15:38:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 15:38:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2018-12-03 15:38:32,866 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 22 [2018-12-03 15:38:32,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:32,866 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2018-12-03 15:38:32,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:32,867 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2018-12-03 15:38:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:38:32,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:32,868 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:38:32,868 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:32,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1840514439, now seen corresponding path program 1 times [2018-12-03 15:38:32,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:32,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:32,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:32,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:32,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:33,270 WARN L180 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-12-03 15:38:33,365 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:33,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:33,366 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:38:33,367 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-03 15:38:33,369 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42] [2018-12-03 15:38:33,416 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:38:33,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:38:34,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:38:34,401 INFO L272 AbstractInterpreter]: Visited 17 different actions 104 times. Merged at 16 different actions 65 times. Widened at 5 different actions 8 times. Found 22 fixpoints after 10 different actions. Largest state had 0 variables. [2018-12-03 15:38:34,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:34,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:38:34,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:38:34,449 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:38:34,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:34,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:38:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:34,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:38:34,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:38:35,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:35,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:38:35,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-03 15:38:35,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:38:35,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:38:35,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:38:35,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:38:35,112 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand 8 states. [2018-12-03 15:38:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:36,454 INFO L93 Difference]: Finished difference Result 394 states and 489 transitions. [2018-12-03 15:38:36,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:38:36,455 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-03 15:38:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:36,457 INFO L225 Difference]: With dead ends: 394 [2018-12-03 15:38:36,457 INFO L226 Difference]: Without dead ends: 256 [2018-12-03 15:38:36,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:38:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-03 15:38:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 177. [2018-12-03 15:38:36,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 15:38:36,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 217 transitions. [2018-12-03 15:38:36,513 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 217 transitions. Word has length 22 [2018-12-03 15:38:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:36,513 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 217 transitions. [2018-12-03 15:38:36,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:38:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 217 transitions. [2018-12-03 15:38:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:38:36,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:36,516 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:38:36,521 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:36,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:36,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1658458437, now seen corresponding path program 2 times [2018-12-03 15:38:36,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:36,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:36,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:38:36,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:36,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:36,728 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 15:38:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 15:38:36,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:36,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:38:36,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:36,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:36,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:36,734 INFO L87 Difference]: Start difference. First operand 177 states and 217 transitions. Second operand 3 states. [2018-12-03 15:38:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:36,822 INFO L93 Difference]: Finished difference Result 407 states and 493 transitions. [2018-12-03 15:38:36,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:36,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 15:38:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:36,825 INFO L225 Difference]: With dead ends: 407 [2018-12-03 15:38:36,825 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 15:38:36,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:36,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 15:38:36,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 151. [2018-12-03 15:38:36,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 15:38:36,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 177 transitions. [2018-12-03 15:38:36,886 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 177 transitions. Word has length 42 [2018-12-03 15:38:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:36,888 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 177 transitions. [2018-12-03 15:38:36,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 177 transitions. [2018-12-03 15:38:36,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:38:36,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:38:36,892 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-03 15:38:36,892 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:38:36,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:38:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2072190841, now seen corresponding path program 3 times [2018-12-03 15:38:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:38:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:36,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:38:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:38:36,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:38:36,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:38:36,988 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-12-03 15:38:36,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:38:36,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:38:36,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:38:36,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:38:36,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:38:36,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:38:36,990 INFO L87 Difference]: Start difference. First operand 151 states and 177 transitions. Second operand 3 states. [2018-12-03 15:38:36,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:38:36,998 INFO L93 Difference]: Finished difference Result 153 states and 179 transitions. [2018-12-03 15:38:36,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:38:36,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-12-03 15:38:36,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:38:36,999 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:38:36,999 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:38:37,000 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:38:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:38:37,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:38:37,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:38:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:38:37,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-03 15:38:37,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:38:37,001 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:38:37,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:38:37,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:38:37,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:38:37,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:38:37,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,085 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,090 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,124 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,153 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,181 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,214 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,252 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:38:37,586 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-03 15:38:37,715 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2018-12-03 15:38:38,197 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2018-12-03 15:38:38,357 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-03 15:38:38,480 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-12-03 15:38:38,612 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-12-03 15:38:38,675 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 57 313) no Hoare annotation was computed. [2018-12-03 15:38:38,675 INFO L444 ceAbstractionStarter]: At program point L250(lines 250 260) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (= ~mode3 (* 256 .cse0)) (<= 1 ~mode2) (<= ~r1 1) .cse1 .cse2 (<= (div ~mode2 256) 0) .cse3 (not (= ~p2_new ~nomsg))) (and (and (not (= ~p2_old ~nomsg)) .cse1 .cse2 .cse3) (<= 1 ~mode3) (<= .cse0 0)))) [2018-12-03 15:38:38,676 INFO L444 ceAbstractionStarter]: At program point L310(lines 200 310) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~r1 0) (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3))) [2018-12-03 15:38:38,676 INFO L444 ceAbstractionStarter]: At program point L277(lines 277 284) the Hoare annotation is: (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 15:38:38,677 INFO L444 ceAbstractionStarter]: At program point L304(lines 304 311) the Hoare annotation is: false [2018-12-03 15:38:38,677 INFO L444 ceAbstractionStarter]: At program point L207(lines 207 215) the Hoare annotation is: (let ((.cse4 (div ~mode3 256)) (.cse0 (<= ~send2 127)) (.cse2 (div ~mode2 256)) (.cse1 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1)))) (or (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse0 .cse1 (<= .cse2 0) (<= 1 ~mode3) .cse3 (<= .cse4 0)) (and (= ~r1 0) (= ~mode3 (* 256 .cse4)) (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (= ~mode2 (* 256 .cse2)) .cse1 .cse3))) [2018-12-03 15:38:38,677 INFO L444 ceAbstractionStarter]: At program point L298(lines 298 305) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (= ULTIMATE.start_assert_~arg 1) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 15:38:38,677 INFO L444 ceAbstractionStarter]: At program point L265(lines 259 266) the Hoare annotation is: (and (<= 1 ~mode2) (<= ~r1 1) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0) (not (= ~p2_new ~nomsg))) [2018-12-03 15:38:38,677 INFO L444 ceAbstractionStarter]: At program point L288(lines 283 289) the Hoare annotation is: (and (<= 1 ULTIMATE.start_check_~tmp~75) (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) (<= ~send2 127) (< 0 (+ (div ~send2 256) 1)) (<= (div ~mode2 256) 0) (<= 1 ~mode3) (= 0 (+ ~nomsg 1)) (<= (div ~mode3 256) 0)) [2018-12-03 15:38:38,678 INFO L444 ceAbstractionStarter]: At program point L222(lines 214 223) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (and (= ~r1 0) (= ~mode3 (* 256 .cse0)) .cse1 .cse2 .cse3) (= ~mode2 (* 256 .cse4))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse1 .cse2 (<= .cse4 0) (<= 1 ~mode3) .cse3 (<= .cse0 0)))) [2018-12-03 15:38:38,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 57 313) no Hoare annotation was computed. [2018-12-03 15:38:38,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 57 313) no Hoare annotation was computed. [2018-12-03 15:38:38,678 INFO L444 ceAbstractionStarter]: At program point L245(lines 236 246) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (= ~mode3 (* 256 .cse0)) (<= 1 ~mode2) (<= ~r1 1) .cse1 .cse2 (<= (div ~mode2 256) 0) .cse3 (not (= ~p2_new ~nomsg))) (and (and (not (= ~p2_old ~nomsg)) .cse1 .cse2 .cse3) (<= 1 ~mode3) (<= .cse0 0)))) [2018-12-03 15:38:38,678 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 312) no Hoare annotation was computed. [2018-12-03 15:38:38,678 INFO L444 ceAbstractionStarter]: At program point L227(lines 227 237) the Hoare annotation is: (let ((.cse1 (<= ~send2 127)) (.cse2 (< 0 (+ (div ~send2 256) 1))) (.cse4 (div ~mode2 256)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse0 (div ~mode3 256))) (or (and (and (= ~r1 0) (= ~mode3 (* 256 .cse0)) .cse1 .cse2 .cse3) (= ~mode2 (* 256 .cse4))) (and (not (= ~p2_old ~nomsg)) (<= 1 ~mode2) .cse1 .cse2 (<= .cse4 0) (<= 1 ~mode3) .cse3 (<= .cse0 0)))) [2018-12-03 15:38:38,695 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:38:38 BoogieIcfgContainer [2018-12-03 15:38:38,695 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:38:38,696 INFO L168 Benchmark]: Toolchain (without parser) took 8299.90 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 714.6 MB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -338.9 MB). Peak memory consumption was 375.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:38:38,698 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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:38:38,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.19 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:38:38,699 INFO L168 Benchmark]: Boogie Preprocessor took 45.56 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:38:38,699 INFO L168 Benchmark]: RCFGBuilder took 634.59 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:38:38,700 INFO L168 Benchmark]: TraceAbstraction took 7574.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -370.6 MB). Peak memory consumption was 344.0 MB. Max. memory is 7.1 GB. [2018-12-03 15:38:38,705 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.22 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.19 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 45.56 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 634.59 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 7574.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -370.6 MB). Peak memory consumption was 344.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 312]: 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: 207]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) - InvariantResult [Line: 250]: Loop Invariant Derived loop invariant: (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: ((((((((1 <= check_~tmp~75 && assert_~arg == 1) && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: (((((((~mode3 == 256 * (~mode3 / 256) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 0 == ~nomsg + 1) && !(~p2_new == ~nomsg)) || (((((!(~p2_old == ~nomsg) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && 1 <= ~mode3) && ~mode3 / 256 <= 0) - InvariantResult [Line: 277]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 283]: Loop Invariant Derived loop invariant: (((((((1 <= check_~tmp~75 && !(~p2_old == ~nomsg)) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0 - InvariantResult [Line: 200]: Loop Invariant Derived loop invariant: (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) || ((((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send2 <= 127) && ~mode2 == 256 * (~mode2 / 256)) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) - InvariantResult [Line: 227]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 214]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && ~mode3 == 256 * (~mode3 / 256)) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && 0 == ~nomsg + 1) && ~mode2 == 256 * (~mode2 / 256)) || (((((((!(~p2_old == ~nomsg) && 1 <= ~mode2) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) - InvariantResult [Line: 259]: Loop Invariant Derived loop invariant: (((((((1 <= ~mode2 && ~r1 <= 1) && ~send2 <= 127) && 0 < ~send2 / 256 + 1) && ~mode2 / 256 <= 0) && 1 <= ~mode3) && 0 == ~nomsg + 1) && ~mode3 / 256 <= 0) && !(~p2_new == ~nomsg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. SAFE Result, 7.4s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 156 SDtfs, 169 SDslu, 141 SDs, 0 SdLazy, 119 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.0s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 146 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 67 NumberOfFragments, 592 HoareAnnotationTreeSize, 11 FomulaSimplifications, 5115 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 11 FomulaSimplificationsInter, 398 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 198 NumberOfCodeBlocks, 198 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 19442 SizeOfPredicates, 7 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 142/160 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...