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/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:55:00,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:55:00,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:55:00,144 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:55:00,144 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:55:00,145 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:55:00,147 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:55:00,149 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:55:00,151 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:55:00,152 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:55:00,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:55:00,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:55:00,154 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:55:00,155 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:55:00,156 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:55:00,157 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:55:00,158 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:55:00,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:55:00,162 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:55:00,163 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:55:00,164 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:55:00,165 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:55:00,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:55:00,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:55:00,168 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:55:00,169 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:55:00,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:55:00,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:55:00,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:55:00,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:55:00,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:55:00,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:55:00,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:55:00,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:55:00,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:55:00,176 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:55:00,176 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:55:00,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:55:00,193 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:55:00,194 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:55:00,194 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:55:00,194 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:55:00,194 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:55:00,194 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:55:00,195 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:55:00,195 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:55:00,196 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:55:00,196 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:55:00,196 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:55:00,196 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:55:00,197 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:55:00,197 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:55:00,197 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:55:00,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:55:00,199 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:55:00,200 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:55:00,200 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:55:00,200 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:55:00,200 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:55:00,200 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:55:00,201 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:55:00,201 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:55:00,201 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:55:00,201 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:55:00,202 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:55:00,202 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:55:00,202 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:55:00,202 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:55:00,202 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:55:00,203 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:55:00,203 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:55:00,203 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:55:00,203 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:55:00,203 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:55:00,204 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:55:00,204 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:55:00,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:55:00,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:55:00,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:55:00,284 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:55:00,285 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:55:00,286 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.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 17:55:00,286 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl' [2018-12-03 17:55:00,398 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:55:00,400 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:55:00,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:55:00,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:55:00,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:55:00,421 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,439 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:55:00,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:55:00,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:55:00,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:55:00,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... [2018-12-03 17:55:00,526 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:55:00,527 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:55:00,527 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:55:00,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:55:00,528 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:55:00,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:55:00,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:55:01,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:55:01,267 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:55:01,267 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:55:01 BoogieIcfgContainer [2018-12-03 17:55:01,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:55:01,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:55:01,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:55:01,272 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:55:01,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:55:00" (1/2) ... [2018-12-03 17:55:01,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d219b9 and model type pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:55:01, skipping insertion in model container [2018-12-03 17:55:01,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:55:01" (2/2) ... [2018-12-03 17:55:01,276 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl [2018-12-03 17:55:01,287 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:55:01,296 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:55:01,315 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:55:01,351 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:55:01,351 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:55:01,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:55:01,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:55:01,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:55:01,352 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:55:01,352 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:55:01,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:55:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-12-03 17:55:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:55:01,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:01,377 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:01,380 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:01,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:01,387 INFO L82 PathProgramCache]: Analyzing trace with hash -417618601, now seen corresponding path program 1 times [2018-12-03 17:55:01,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:01,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:01,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:01,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:01,452 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:01,654 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:55:01,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:01,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:01,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:01,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:01,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:01,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:01,683 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-12-03 17:55:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:01,747 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2018-12-03 17:55:01,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:01,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:55:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:01,762 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:55:01,762 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:55:01,767 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:55:01,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:55:01,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 17:55:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:55:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2018-12-03 17:55:01,815 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 16 [2018-12-03 17:55:01,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:01,815 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2018-12-03 17:55:01,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:01,816 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2018-12-03 17:55:01,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:55:01,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:01,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:01,817 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:01,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1428735851, now seen corresponding path program 1 times [2018-12-03 17:55:01,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:01,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:01,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:01,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:01,949 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:55:01,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:01,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:01,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:01,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:01,953 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 3 states. [2018-12-03 17:55:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:02,008 INFO L93 Difference]: Finished difference Result 91 states and 127 transitions. [2018-12-03 17:55:02,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:02,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:55:02,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:02,011 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:55:02,011 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:55:02,013 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:55:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:55:02,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 17:55:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:55:02,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 82 transitions. [2018-12-03 17:55:02,031 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 82 transitions. Word has length 16 [2018-12-03 17:55:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:02,031 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 82 transitions. [2018-12-03 17:55:02,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 82 transitions. [2018-12-03 17:55:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:55:02,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:02,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:02,033 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:02,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1821762861, now seen corresponding path program 1 times [2018-12-03 17:55:02,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:02,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:02,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:02,189 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:55:02,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:02,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:02,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:02,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:02,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:02,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:02,194 INFO L87 Difference]: Start difference. First operand 59 states and 82 transitions. Second operand 3 states. [2018-12-03 17:55:02,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:02,283 INFO L93 Difference]: Finished difference Result 175 states and 244 transitions. [2018-12-03 17:55:02,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:02,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:55:02,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:02,289 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:55:02,289 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:55:02,290 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:55:02,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:55:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 17:55:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:55:02,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 158 transitions. [2018-12-03 17:55:02,347 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 158 transitions. Word has length 16 [2018-12-03 17:55:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:02,348 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 158 transitions. [2018-12-03 17:55:02,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 158 transitions. [2018-12-03 17:55:02,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:55:02,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:02,352 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:02,352 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:02,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1012416235, now seen corresponding path program 1 times [2018-12-03 17:55:02,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:02,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:02,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:02,464 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:55:02,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:02,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:02,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:02,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:02,469 INFO L87 Difference]: Start difference. First operand 115 states and 158 transitions. Second operand 3 states. [2018-12-03 17:55:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:02,540 INFO L93 Difference]: Finished difference Result 343 states and 472 transitions. [2018-12-03 17:55:02,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:02,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:55:02,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:02,543 INFO L225 Difference]: With dead ends: 343 [2018-12-03 17:55:02,544 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 17:55:02,545 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:55:02,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 17:55:02,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-12-03 17:55:02,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 17:55:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 306 transitions. [2018-12-03 17:55:02,593 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 306 transitions. Word has length 16 [2018-12-03 17:55:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:02,593 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 306 transitions. [2018-12-03 17:55:02,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:02,594 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 306 transitions. [2018-12-03 17:55:02,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:55:02,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:02,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:02,595 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:02,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:02,596 INFO L82 PathProgramCache]: Analyzing trace with hash -955157933, now seen corresponding path program 1 times [2018-12-03 17:55:02,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:02,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:02,693 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:55:02,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:02,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:55:02,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:02,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:02,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:02,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:02,696 INFO L87 Difference]: Start difference. First operand 227 states and 306 transitions. Second operand 3 states. [2018-12-03 17:55:02,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:02,830 INFO L93 Difference]: Finished difference Result 569 states and 770 transitions. [2018-12-03 17:55:02,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:02,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 17:55:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:02,834 INFO L225 Difference]: With dead ends: 569 [2018-12-03 17:55:02,835 INFO L226 Difference]: Without dead ends: 343 [2018-12-03 17:55:02,837 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:55:02,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-12-03 17:55:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-12-03 17:55:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-03 17:55:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 456 transitions. [2018-12-03 17:55:02,899 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 456 transitions. Word has length 16 [2018-12-03 17:55:02,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:02,900 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 456 transitions. [2018-12-03 17:55:02,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:02,900 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 456 transitions. [2018-12-03 17:55:02,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:55:02,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:02,901 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 17:55:02,901 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:02,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:02,902 INFO L82 PathProgramCache]: Analyzing trace with hash -955217515, now seen corresponding path program 1 times [2018-12-03 17:55:02,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:02,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:02,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:02,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:03,125 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:55:03,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:03,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 17:55:03,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:03,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:55:03,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:55:03,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:55:03,127 INFO L87 Difference]: Start difference. First operand 341 states and 456 transitions. Second operand 4 states. [2018-12-03 17:55:03,291 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 17:55:03,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:03,500 INFO L93 Difference]: Finished difference Result 610 states and 805 transitions. [2018-12-03 17:55:03,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:55:03,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 17:55:03,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:03,505 INFO L225 Difference]: With dead ends: 610 [2018-12-03 17:55:03,506 INFO L226 Difference]: Without dead ends: 608 [2018-12-03 17:55:03,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:55:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-12-03 17:55:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 373. [2018-12-03 17:55:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-12-03 17:55:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 480 transitions. [2018-12-03 17:55:03,599 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 480 transitions. Word has length 16 [2018-12-03 17:55:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:03,600 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 480 transitions. [2018-12-03 17:55:03,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:55:03,604 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 480 transitions. [2018-12-03 17:55:03,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:55:03,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:03,607 INFO L402 BasicCegarLoop]: trace histogram [2, 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:55:03,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:03,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1530501555, now seen corresponding path program 1 times [2018-12-03 17:55:03,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:03,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:03,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:03,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:03,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:03,856 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-12-03 17:55:03,861 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:03,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:55:03,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:55:03,862 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:55:03,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:55:03,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:55:03,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:55:03,872 INFO L87 Difference]: Start difference. First operand 373 states and 480 transitions. Second operand 3 states. [2018-12-03 17:55:04,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:55:04,077 INFO L93 Difference]: Finished difference Result 1113 states and 1434 transitions. [2018-12-03 17:55:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:55:04,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 17:55:04,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:55:04,084 INFO L225 Difference]: With dead ends: 1113 [2018-12-03 17:55:04,085 INFO L226 Difference]: Without dead ends: 743 [2018-12-03 17:55:04,093 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 17:55:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2018-12-03 17:55:04,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2018-12-03 17:55:04,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-12-03 17:55:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 932 transitions. [2018-12-03 17:55:04,234 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 932 transitions. Word has length 30 [2018-12-03 17:55:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:55:04,234 INFO L480 AbstractCegarLoop]: Abstraction has 741 states and 932 transitions. [2018-12-03 17:55:04,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:55:04,235 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 932 transitions. [2018-12-03 17:55:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:55:04,239 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:55:04,240 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, 1, 1] [2018-12-03 17:55:04,240 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:55:04,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:55:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1272336117, now seen corresponding path program 1 times [2018-12-03 17:55:04,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:55:04,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:04,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:55:04,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:55:04,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:55:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:55:04,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:55:04,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:55:04,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:55:04,473 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 31 with the following transitions: [2018-12-03 17:55:04,475 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18], [22], [24], [26], [30], [32], [34], [38], [40], [42], [46], [48], [50], [54], [56], [58] [2018-12-03 17:55:04,548 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:55:04,549 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:55:06,063 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 17:56:39,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:56:39,028 INFO L272 AbstractInterpreter]: Visited 23 different actions 498 times. Merged at 22 different actions 353 times. Widened at 20 different actions 221 times. Found 104 fixpoints after 15 different actions. Largest state had 0 variables. [2018-12-03 17:56:39,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:39,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:56:39,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:56:39,043 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 17:56:39,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:39,065 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:56:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:39,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:56:39,483 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:56:39,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:56:40,024 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 10 [2018-12-03 17:56:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 17:56:40,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:56:40,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2018-12-03 17:56:40,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:56:40,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:56:40,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:56:40,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:56:40,077 INFO L87 Difference]: Start difference. First operand 741 states and 932 transitions. Second operand 8 states. [2018-12-03 17:56:40,302 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-03 17:56:40,780 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:56:41,180 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-03 17:56:41,423 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-03 17:56:42,510 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:56:42,904 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 17:56:43,124 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 17:56:43,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:43,356 INFO L93 Difference]: Finished difference Result 1749 states and 2207 transitions. [2018-12-03 17:56:43,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:56:43,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-12-03 17:56:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:43,363 INFO L225 Difference]: With dead ends: 1749 [2018-12-03 17:56:43,364 INFO L226 Difference]: Without dead ends: 1011 [2018-12-03 17:56:43,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:56:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-12-03 17:56:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 647. [2018-12-03 17:56:43,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-12-03 17:56:43,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 783 transitions. [2018-12-03 17:56:43,514 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 783 transitions. Word has length 30 [2018-12-03 17:56:43,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:43,514 INFO L480 AbstractCegarLoop]: Abstraction has 647 states and 783 transitions. [2018-12-03 17:56:43,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:56:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 783 transitions. [2018-12-03 17:56:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:56:43,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:56:43,522 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 17:56:43,523 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:56:43,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:56:43,523 INFO L82 PathProgramCache]: Analyzing trace with hash 661288113, now seen corresponding path program 2 times [2018-12-03 17:56:43,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:56:43,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:43,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:56:43,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:56:43,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:56:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:56:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 17:56:43,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:56:43,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:56:43,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:56:43,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:56:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:56:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:56:43,721 INFO L87 Difference]: Start difference. First operand 647 states and 783 transitions. Second operand 3 states. [2018-12-03 17:56:43,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:56:43,770 INFO L93 Difference]: Finished difference Result 727 states and 879 transitions. [2018-12-03 17:56:43,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:56:43,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-12-03 17:56:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:56:43,771 INFO L225 Difference]: With dead ends: 727 [2018-12-03 17:56:43,772 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 17:56:43,773 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:56:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 17:56:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 17:56:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 17:56:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 17:56:43,774 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2018-12-03 17:56:43,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:56:43,774 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 17:56:43,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:56:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 17:56:43,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 17:56:43,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 17:56:43,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,837 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,851 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,853 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,854 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,874 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,908 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,977 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,997 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:43,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,030 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,059 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,065 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,092 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,093 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,110 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,196 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,224 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 17:56:44,225 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 53 [2018-12-03 17:56:45,603 WARN L180 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 17:56:45,755 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 24 [2018-12-03 17:56:45,932 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-03 17:56:46,099 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 17:56:46,300 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 17:56:46,742 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 17:56:46,889 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 17:56:47,121 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2018-12-03 17:56:47,244 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2018-12-03 17:56:47,408 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-12-03 17:56:47,693 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2018-12-03 17:56:47,722 INFO L444 ceAbstractionStarter]: At program point L316(lines 316 327) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 17:56:47,723 INFO L444 ceAbstractionStarter]: At program point L399(lines 399 409) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 17:56:47,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 91 466) no Hoare annotation was computed. [2018-12-03 17:56:47,723 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 91 466) no Hoare annotation was computed. [2018-12-03 17:56:47,724 INFO L444 ceAbstractionStarter]: At program point L441(lines 436 442) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 17:56:47,724 INFO L444 ceAbstractionStarter]: At program point L371(lines 365 372) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 17:56:47,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 465) no Hoare annotation was computed. [2018-12-03 17:56:47,724 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 91 466) no Hoare annotation was computed. [2018-12-03 17:56:47,725 INFO L444 ceAbstractionStarter]: At program point L351(lines 345 352) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 17:56:47,725 INFO L444 ceAbstractionStarter]: At program point L376(lines 376 388) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 17:56:47,725 INFO L444 ceAbstractionStarter]: At program point L463(lines 463 464) the Hoare annotation is: false [2018-12-03 17:56:47,725 INFO L444 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (and (= ~r1 0) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 17:56:47,725 INFO L444 ceAbstractionStarter]: At program point L331(lines 326 332) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 17:56:47,726 INFO L444 ceAbstractionStarter]: At program point L459(lines 309 459) the Hoare annotation is: (let ((.cse1 (= ~r1 0)) (.cse2 (<= ~send4 127)) (.cse3 (= 0 (+ ~nomsg 1))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse0 (div ~mode5 256))) (or (and (= ~mode5 (* 256 .cse0)) .cse1 (= ~mode3 (* 256 (div ~mode3 256))) (= ~mode1 (* 256 (div ~mode1 256))) .cse2 .cse3 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse1 (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) .cse2 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse3 (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) .cse4 (<= .cse0 0)))) [2018-12-03 17:56:47,726 INFO L444 ceAbstractionStarter]: At program point L356(lines 356 366) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 17:56:47,726 INFO L444 ceAbstractionStarter]: At program point L451(lines 451 460) the Hoare annotation is: (and (= ~r1 0) (<= 1 ULTIMATE.start_check_~tmp~127) (<= 1 ~mode5) (<= ~send4 127) (<= (div ULTIMATE.start_assert_~arg 256) 0) (= 0 (+ ~nomsg 1)) (<= 1 ULTIMATE.start_assert_~arg) (not (= ~p4_old ~nomsg)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 17:56:47,726 INFO L444 ceAbstractionStarter]: At program point L414(lines 408 415) the Hoare annotation is: (and (= ~r1 0) (not (= ~p4_new ~nomsg)) (<= 1 ~mode5) (<= ~send4 127) (= 0 (+ ~nomsg 1)) (< 0 (+ (div ~send4 256) 1)) (<= (div ~mode5 256) 0)) [2018-12-03 17:56:47,727 INFO L444 ceAbstractionStarter]: At program point L336(lines 336 346) the Hoare annotation is: (let ((.cse6 (div ~mode5 256))) (let ((.cse7 (= ~r1 0)) (.cse0 (<= 1 ~mode5)) (.cse1 (<= ~send4 127)) (.cse2 (= 0 (+ ~nomsg 1))) (.cse3 (not (= ~p4_old ~nomsg))) (.cse4 (< 0 (+ (div ~send4 256) 1))) (.cse5 (<= .cse6 0))) (or (and (= ~mode1 (* 256 (div ~mode1 256))) .cse0 (<= ~r1 1) .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~mode5 (* 256 .cse6)) .cse7 (= ~mode3 (* 256 (div ~mode3 256))) .cse1 .cse2 (= ~mode4 (* 256 (div ~mode4 256))) .cse4) (and .cse7 (<= 1 ULTIMATE.start_check_~tmp~127) .cse0 .cse1 (<= (div ULTIMATE.start_assert_~arg 256) 0) .cse2 (<= 1 ULTIMATE.start_assert_~arg) .cse3 .cse4 .cse5)))) [2018-12-03 17:56:47,727 INFO L444 ceAbstractionStarter]: At program point L394(lines 387 395) the Hoare annotation is: (let ((.cse11 (div ~mode5 256))) (let ((.cse8 (= ~mode4 (* 256 (div ~mode4 256)))) (.cse13 (= ~mode1 (* 256 (div ~mode1 256)))) (.cse14 (<= ~r1 1)) (.cse2 (<= 1 ~mode5)) (.cse10 (<= .cse11 0)) (.cse0 (= ~r1 0)) (.cse1 (<= 1 ULTIMATE.start_check_~tmp~127)) (.cse12 (not (= ~p4_new ~nomsg))) (.cse3 (<= ~send4 127)) (.cse4 (<= (div ULTIMATE.start_assert_~arg 256) 0)) (.cse5 (= 0 (+ ~nomsg 1))) (.cse6 (<= 1 ULTIMATE.start_assert_~arg)) (.cse7 (not (= ~p4_old ~nomsg))) (.cse9 (< 0 (+ (div ~send4 256) 1)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and (= ~mode5 (* 256 .cse11)) .cse0 .cse12 .cse3 .cse5 .cse9) (and .cse13 .cse14 .cse2 .cse3 .cse5 .cse7 .cse8 .cse9 .cse10) (and .cse13 .cse12 .cse14 .cse2 .cse3 .cse5 .cse7 .cse9 .cse10) (and .cse0 .cse1 .cse12 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9)))) [2018-12-03 17:56:47,751 INFO L202 PluginConnector]: Adding new model pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c_11.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 05:56:47 BoogieIcfgContainer [2018-12-03 17:56:47,752 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 17:56:47,753 INFO L168 Benchmark]: Toolchain (without parser) took 107354.46 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.5 GB in the beginning and 3.9 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 17:56:47,754 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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 17:56:47,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.17 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:56:47,755 INFO L168 Benchmark]: Boogie Preprocessor took 66.32 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:56:47,756 INFO L168 Benchmark]: RCFGBuilder took 740.37 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:56:47,757 INFO L168 Benchmark]: TraceAbstraction took 106483.23 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-12-03 17:56:47,761 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.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 Procedure Inliner took 59.17 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 66.32 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 740.37 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 106483.23 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.7 GB). Free memory was 1.4 GB in the beginning and 3.9 GB in the end (delta: -2.4 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 465]: 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: 356]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 451]: Loop Invariant Derived loop invariant: ((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 326]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: (((((~r1 == 0 && !(~p4_new == ~nomsg)) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0 - InvariantResult [Line: 365]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 316]: Loop Invariant Derived loop invariant: (((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~mode1 == 256 * (~mode1 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((((~mode1 == 256 * (~mode1 / 256) && 1 <= ~mode5) && ~r1 <= 1) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || ((((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && ~mode3 == 256 * (~mode3 / 256)) && ~send4 <= 127) && 0 == ~nomsg + 1) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1)) || (((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) - InvariantResult [Line: 399]: Loop Invariant Derived loop invariant: (((((((((((((~r1 == 0 && 1 <= check_~tmp~127) && 1 <= ~mode5) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0) || (((((~mode5 == 256 * (~mode5 / 256) && ~r1 == 0) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && 0 == ~nomsg + 1) && 0 < ~send4 / 256 + 1)) || ((((((((~mode1 == 256 * (~mode1 / 256) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && ~mode4 == 256 * (~mode4 / 256)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~mode1 == 256 * (~mode1 / 256) && !(~p4_new == ~nomsg)) && ~r1 <= 1) && 1 <= ~mode5) && ~send4 <= 127) && 0 == ~nomsg + 1) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) && ~mode5 / 256 <= 0)) || ((((((((~r1 == 0 && 1 <= check_~tmp~127) && !(~p4_new == ~nomsg)) && ~send4 <= 127) && assert_~arg / 256 <= 0) && 0 == ~nomsg + 1) && 1 <= assert_~arg) && !(~p4_old == ~nomsg)) && 0 < ~send4 / 256 + 1) - InvariantResult [Line: 463]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. SAFE Result, 106.3s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 4.4s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 284 SDtfs, 230 SDslu, 231 SDs, 0 SdLazy, 167 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 94.5s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 611 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 107 NumberOfFragments, 1441 HoareAnnotationTreeSize, 15 FomulaSimplifications, 10115 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 15 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 244 NumberOfCodeBlocks, 244 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 34017 SizeOfPredicates, 8 NumberOfNonLiveVariables, 299 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 110/140 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...