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/toy.cil.c_34.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:43:32,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:43:32,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:43:32,842 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:43:32,843 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:43:32,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:43:32,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:43:32,851 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:43:32,854 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:43:32,857 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:43:32,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:43:32,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:43:32,862 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:43:32,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:43:32,866 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:43:32,867 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:43:32,869 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:43:32,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:43:32,880 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:43:32,887 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:43:32,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:43:32,891 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:43:32,895 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:43:32,895 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:43:32,896 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:43:32,900 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:43:32,901 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:43:32,904 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:43:32,905 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:43:32,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:43:32,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:43:32,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:43:32,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:43:32,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:43:32,910 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:43:32,911 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:43:32,911 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:43:32,928 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:43:32,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:43:32,931 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:43:32,931 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:43:32,932 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:43:32,932 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:43:32,932 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:43:32,932 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:43:32,932 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:43:32,933 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:43:32,933 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:43:32,933 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:43:32,933 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:43:32,933 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:43:32,934 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:43:32,934 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:43:32,935 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:43:32,935 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:43:32,935 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:43:32,935 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:43:32,935 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:43:32,936 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:43:32,936 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:43:32,936 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:43:32,936 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:43:32,937 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:43:32,937 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:43:32,937 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:43:32,937 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:43:32,937 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:43:32,938 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:43:32,938 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:43:32,938 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:43:32,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:43:32,941 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:43:32,941 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:43:32,941 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:43:32,941 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:43:32,942 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:43:32,942 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:43:32,942 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:43:32,993 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:43:33,008 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:43:33,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:43:33,017 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:43:33,017 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:43:33,019 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl [2018-12-03 15:43:33,019 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/toy.cil.c_34.bpl' [2018-12-03 15:43:33,104 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:43:33,106 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:43:33,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:43:33,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:43:33,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:43:33,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:43:33,152 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:43:33,152 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:43:33,152 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:43:33,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/1) ... [2018-12-03 15:43:33,211 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:43:33,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:43:33,212 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:43:33,212 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:43:33,213 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (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:43:33,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:43:33,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:43:33,909 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:43:33,910 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-03 15:43:33,910 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:43:33 BoogieIcfgContainer [2018-12-03 15:43:33,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:43:33,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:43:33,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:43:33,915 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:43:33,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:43:33" (1/2) ... [2018-12-03 15:43:33,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e26320 and model type toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:43:33, skipping insertion in model container [2018-12-03 15:43:33,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:43:33" (2/2) ... [2018-12-03 15:43:33,918 INFO L112 eAbstractionObserver]: Analyzing ICFG toy.cil.c_34.bpl [2018-12-03 15:43:33,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:43:33,937 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:43:33,955 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:43:33,990 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:43:33,991 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:43:33,991 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:43:33,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:43:33,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:43:33,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:43:33,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:43:33,992 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:43:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-03 15:43:34,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:43:34,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:34,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:34,019 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:34,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash 89968813, now seen corresponding path program 1 times [2018-12-03 15:43:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:34,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:34,206 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:43:34,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:34,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:43:34,209 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:34,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:34,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:34,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:34,229 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 3 states. [2018-12-03 15:43:34,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:34,338 INFO L93 Difference]: Finished difference Result 82 states and 137 transitions. [2018-12-03 15:43:34,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:34,340 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-03 15:43:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:34,353 INFO L225 Difference]: With dead ends: 82 [2018-12-03 15:43:34,353 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:43:34,357 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:43:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:43:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:43:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:43:34,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 74 transitions. [2018-12-03 15:43:34,403 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 74 transitions. Word has length 8 [2018-12-03 15:43:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:34,403 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 74 transitions. [2018-12-03 15:43:34,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 74 transitions. [2018-12-03 15:43:34,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:43:34,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:34,405 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:34,405 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:34,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:34,406 INFO L82 PathProgramCache]: Analyzing trace with hash 120520176, now seen corresponding path program 1 times [2018-12-03 15:43:34,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:34,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:34,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:34,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:34,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:43:34,467 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:34,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:34,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:34,470 INFO L87 Difference]: Start difference. First operand 47 states and 74 transitions. Second operand 3 states. [2018-12-03 15:43:34,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:34,556 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2018-12-03 15:43:34,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:34,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 15:43:34,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:34,558 INFO L225 Difference]: With dead ends: 98 [2018-12-03 15:43:34,559 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:43:34,560 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:43:34,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:43:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:43:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:43:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2018-12-03 15:43:34,570 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 16 [2018-12-03 15:43:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:34,571 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2018-12-03 15:43:34,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2018-12-03 15:43:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:43:34,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:34,572 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:34,573 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:34,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:34,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1929846560, now seen corresponding path program 1 times [2018-12-03 15:43:34,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:34,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:34,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:34,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:43:34,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:34,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:34,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:34,692 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand 3 states. [2018-12-03 15:43:34,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:34,756 INFO L93 Difference]: Finished difference Result 105 states and 164 transitions. [2018-12-03 15:43:34,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:34,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 15:43:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:34,761 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:43:34,761 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:43:34,762 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:43:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:43:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:43:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:43:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2018-12-03 15:43:34,775 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 18 [2018-12-03 15:43:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:34,776 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2018-12-03 15:43:34,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2018-12-03 15:43:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:43:34,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:34,779 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:34,780 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:34,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1005370575, now seen corresponding path program 1 times [2018-12-03 15:43:34,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:34,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:34,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:34,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:34,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:34,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:43:34,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:34,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:34,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:34,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:34,887 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2018-12-03 15:43:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:35,003 INFO L93 Difference]: Finished difference Result 122 states and 187 transitions. [2018-12-03 15:43:35,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:35,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 15:43:35,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:35,005 INFO L225 Difference]: With dead ends: 122 [2018-12-03 15:43:35,006 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:43:35,007 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:43:35,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:43:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:43:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:43:35,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2018-12-03 15:43:35,030 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 20 [2018-12-03 15:43:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:35,030 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2018-12-03 15:43:35,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:35,031 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2018-12-03 15:43:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:43:35,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:35,033 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:35,034 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:35,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash -880878013, now seen corresponding path program 1 times [2018-12-03 15:43:35,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:35,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:35,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:43:35,158 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:35,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:35,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:35,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:35,159 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2018-12-03 15:43:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:35,231 INFO L93 Difference]: Finished difference Result 145 states and 222 transitions. [2018-12-03 15:43:35,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:35,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 15:43:35,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:35,233 INFO L225 Difference]: With dead ends: 145 [2018-12-03 15:43:35,233 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:43:35,234 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 15:43:35,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:43:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 15:43:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:43:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 156 transitions. [2018-12-03 15:43:35,250 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 156 transitions. Word has length 22 [2018-12-03 15:43:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:35,250 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 156 transitions. [2018-12-03 15:43:35,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 156 transitions. [2018-12-03 15:43:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:43:35,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:35,252 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:35,252 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:35,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1639081921, now seen corresponding path program 1 times [2018-12-03 15:43:35,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:35,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:35,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:35,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:35,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:35,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:43:35,349 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:35,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:35,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:35,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:35,350 INFO L87 Difference]: Start difference. First operand 104 states and 156 transitions. Second operand 3 states. [2018-12-03 15:43:35,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:35,423 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2018-12-03 15:43:35,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:35,424 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-03 15:43:35,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:35,425 INFO L225 Difference]: With dead ends: 235 [2018-12-03 15:43:35,426 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 15:43:35,427 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 15:43:35,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 15:43:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2018-12-03 15:43:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 15:43:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 237 transitions. [2018-12-03 15:43:35,457 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 237 transitions. Word has length 22 [2018-12-03 15:43:35,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:35,458 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 237 transitions. [2018-12-03 15:43:35,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:35,458 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 237 transitions. [2018-12-03 15:43:35,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:43:35,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:35,462 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:35,462 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:35,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash 149370772, now seen corresponding path program 1 times [2018-12-03 15:43:35,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:35,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:35,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:43:35,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:35,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:43:35,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:35,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:35,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:35,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:35,562 INFO L87 Difference]: Start difference. First operand 158 states and 237 transitions. Second operand 3 states. [2018-12-03 15:43:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:35,614 INFO L93 Difference]: Finished difference Result 288 states and 436 transitions. [2018-12-03 15:43:35,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:35,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 15:43:35,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:35,616 INFO L225 Difference]: With dead ends: 288 [2018-12-03 15:43:35,616 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 15:43:35,617 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:43:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 15:43:35,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 15:43:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 15:43:35,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 243 transitions. [2018-12-03 15:43:35,639 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 243 transitions. Word has length 50 [2018-12-03 15:43:35,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:35,640 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 243 transitions. [2018-12-03 15:43:35,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:35,640 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 243 transitions. [2018-12-03 15:43:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:43:35,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:35,642 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:35,643 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:35,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:35,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1535574166, now seen corresponding path program 1 times [2018-12-03 15:43:35,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:35,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:35,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:43:35,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:35,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:43:35,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:35,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:35,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:35,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:35,734 INFO L87 Difference]: Start difference. First operand 164 states and 243 transitions. Second operand 3 states. [2018-12-03 15:43:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:35,903 INFO L93 Difference]: Finished difference Result 312 states and 468 transitions. [2018-12-03 15:43:35,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:35,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 15:43:35,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:35,907 INFO L225 Difference]: With dead ends: 312 [2018-12-03 15:43:35,907 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 15:43:35,909 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:43:35,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 15:43:35,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 15:43:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 15:43:35,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 266 transitions. [2018-12-03 15:43:35,935 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 266 transitions. Word has length 50 [2018-12-03 15:43:35,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:35,936 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 266 transitions. [2018-12-03 15:43:35,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 266 transitions. [2018-12-03 15:43:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:43:35,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:35,947 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:35,947 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:35,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:35,948 INFO L82 PathProgramCache]: Analyzing trace with hash -129315558, now seen corresponding path program 1 times [2018-12-03 15:43:35,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:35,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:35,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:35,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:43:36,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:36,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:43:36,050 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:36,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:36,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:36,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:36,053 INFO L87 Difference]: Start difference. First operand 182 states and 266 transitions. Second operand 3 states. [2018-12-03 15:43:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:36,152 INFO L93 Difference]: Finished difference Result 345 states and 510 transitions. [2018-12-03 15:43:36,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:36,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 15:43:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:36,154 INFO L225 Difference]: With dead ends: 345 [2018-12-03 15:43:36,154 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 15:43:36,157 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 15:43:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 15:43:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-12-03 15:43:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:43:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 253 transitions. [2018-12-03 15:43:36,190 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 253 transitions. Word has length 50 [2018-12-03 15:43:36,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:36,190 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 253 transitions. [2018-12-03 15:43:36,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 253 transitions. [2018-12-03 15:43:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:43:36,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:36,195 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:36,195 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:36,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:36,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1114557934, now seen corresponding path program 1 times [2018-12-03 15:43:36,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:36,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:36,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:36,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:43:36,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:36,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:43:36,284 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:36,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:36,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:36,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:36,285 INFO L87 Difference]: Start difference. First operand 175 states and 253 transitions. Second operand 3 states. [2018-12-03 15:43:36,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:36,392 INFO L93 Difference]: Finished difference Result 335 states and 490 transitions. [2018-12-03 15:43:36,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:36,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 15:43:36,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:36,396 INFO L225 Difference]: With dead ends: 335 [2018-12-03 15:43:36,397 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 15:43:36,398 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 15:43:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 15:43:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 167. [2018-12-03 15:43:36,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 15:43:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 237 transitions. [2018-12-03 15:43:36,418 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 237 transitions. Word has length 52 [2018-12-03 15:43:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:36,418 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 237 transitions. [2018-12-03 15:43:36,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:36,418 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 237 transitions. [2018-12-03 15:43:36,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:43:36,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:36,419 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:36,420 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:36,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:36,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1372723372, now seen corresponding path program 1 times [2018-12-03 15:43:36,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:36,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:36,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:36,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:36,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:43:36,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:36,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:36,587 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-12-03 15:43:36,589 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [8], [10], [16], [22], [26], [32], [34], [38], [44], [46], [50], [56], [58], [60], [62], [66], [68], [72], [76], [83], [85], [89], [95], [97], [101], [105], [109], [113], [119], [121], [127], [131], [137] [2018-12-03 15:43:36,633 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:43:36,633 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:43:37,176 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-03 15:43:37,180 INFO L272 AbstractInterpreter]: Visited 35 different actions 68 times. Merged at 26 different actions 28 times. Never widened. Found 6 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:43:37,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:37,205 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-03 15:43:37,519 INFO L227 lantSequenceWeakener]: Weakened 50 states. On average, predicates are now at 61.33% of their original sizes. [2018-12-03 15:43:37,519 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-03 15:43:39,606 INFO L418 sIntCurrentIteration]: We unified 51 AI predicates to 51 [2018-12-03 15:43:39,606 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-03 15:43:39,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:43:39,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [37] imperfect sequences [4] total 40 [2018-12-03 15:43:39,608 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:39,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:43:39,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:43:39,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1259, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:43:39,609 INFO L87 Difference]: Start difference. First operand 167 states and 237 transitions. Second operand 38 states. [2018-12-03 15:43:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:49,860 INFO L93 Difference]: Finished difference Result 348 states and 491 transitions. [2018-12-03 15:43:49,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:43:49,860 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2018-12-03 15:43:49,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:49,861 INFO L225 Difference]: With dead ends: 348 [2018-12-03 15:43:49,862 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 15:43:49,865 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 72 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=380, Invalid=3042, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:43:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 15:43:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 178. [2018-12-03 15:43:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 15:43:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2018-12-03 15:43:49,889 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 52 [2018-12-03 15:43:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:49,889 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2018-12-03 15:43:49,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:43:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2018-12-03 15:43:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:43:49,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:49,891 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:49,891 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:49,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:49,891 INFO L82 PathProgramCache]: Analyzing trace with hash 2052781742, now seen corresponding path program 1 times [2018-12-03 15:43:49,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:49,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:49,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:49,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:49,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-03 15:43:49,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:49,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:43:49,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:49,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:49,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:49,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:49,979 INFO L87 Difference]: Start difference. First operand 178 states and 237 transitions. Second operand 3 states. [2018-12-03 15:43:50,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:50,025 INFO L93 Difference]: Finished difference Result 382 states and 530 transitions. [2018-12-03 15:43:50,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:50,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-03 15:43:50,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:50,028 INFO L225 Difference]: With dead ends: 382 [2018-12-03 15:43:50,028 INFO L226 Difference]: Without dead ends: 242 [2018-12-03 15:43:50,028 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 15:43:50,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-03 15:43:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 211. [2018-12-03 15:43:50,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 15:43:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 280 transitions. [2018-12-03 15:43:50,052 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 280 transitions. Word has length 52 [2018-12-03 15:43:50,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:50,053 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 280 transitions. [2018-12-03 15:43:50,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:50,053 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 280 transitions. [2018-12-03 15:43:50,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:43:50,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:50,054 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:50,054 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:50,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:50,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1407140972, now seen corresponding path program 1 times [2018-12-03 15:43:50,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:50,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:50,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-03 15:43:50,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:43:50,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:43:50,139 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:50,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:50,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:50,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:43:50,140 INFO L87 Difference]: Start difference. First operand 211 states and 280 transitions. Second operand 3 states. [2018-12-03 15:43:50,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:50,229 INFO L93 Difference]: Finished difference Result 560 states and 757 transitions. [2018-12-03 15:43:50,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:50,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-03 15:43:50,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:50,232 INFO L225 Difference]: With dead ends: 560 [2018-12-03 15:43:50,232 INFO L226 Difference]: Without dead ends: 344 [2018-12-03 15:43:50,233 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 15:43:50,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-03 15:43:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2018-12-03 15:43:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-12-03 15:43:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 453 transitions. [2018-12-03 15:43:50,269 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 453 transitions. Word has length 75 [2018-12-03 15:43:50,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:50,269 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 453 transitions. [2018-12-03 15:43:50,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 453 transitions. [2018-12-03 15:43:50,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:43:50,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:50,271 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:50,271 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:50,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:50,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1986645264, now seen corresponding path program 1 times [2018-12-03 15:43:50,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:50,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:50,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:50,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:43:50,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:50,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:50,629 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2018-12-03 15:43:50,629 INFO L205 CegarAbsIntRunner]: [0], [2], [4], [8], [10], [14], [16], [20], [22], [26], [28], [32], [34], [38], [40], [44], [46], [50], [52], [56], [58], [60], [62], [66], [68], [72], [74], [76], [81], [83], [85], [89], [91], [95], [97], [101], [103], [105], [109], [111], [113], [117], [119], [121], [125], [127], [131], [133], [137], [139] [2018-12-03 15:43:50,634 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:43:50,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:43:51,632 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:43:51,632 INFO L272 AbstractInterpreter]: Visited 50 different actions 579 times. Merged at 49 different actions 330 times. Widened at 32 different actions 124 times. Found 147 fixpoints after 34 different actions. Largest state had 0 variables. [2018-12-03 15:43:51,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:51,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:43:51,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:51,671 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:43:51,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:51,686 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:51,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:43:51,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 54 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 15:43:52,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:43:52,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 15:43:52,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:43:52,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:43:52,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:43:52,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:43:52,031 INFO L87 Difference]: Start difference. First operand 342 states and 453 transitions. Second operand 8 states. [2018-12-03 15:43:52,867 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:43:53,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:53,825 INFO L93 Difference]: Finished difference Result 2292 states and 3159 transitions. [2018-12-03 15:43:53,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:43:53,827 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2018-12-03 15:43:53,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:53,837 INFO L225 Difference]: With dead ends: 2292 [2018-12-03 15:43:53,837 INFO L226 Difference]: Without dead ends: 1986 [2018-12-03 15:43:53,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:43:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1986 states. [2018-12-03 15:43:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1986 to 1321. [2018-12-03 15:43:53,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2018-12-03 15:43:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1847 transitions. [2018-12-03 15:43:54,001 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1847 transitions. Word has length 75 [2018-12-03 15:43:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:54,001 INFO L480 AbstractCegarLoop]: Abstraction has 1321 states and 1847 transitions. [2018-12-03 15:43:54,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:43:54,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1847 transitions. [2018-12-03 15:43:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:43:54,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:54,003 INFO L402 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:54,004 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:54,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:54,004 INFO L82 PathProgramCache]: Analyzing trace with hash -696864020, now seen corresponding path program 2 times [2018-12-03 15:43:54,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:54,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:54,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:54,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:54,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 128 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 15:43:54,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:54,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:54,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:54,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:54,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:54,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:54,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:43:54,262 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:43:54,316 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:43:54,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:54,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-03 15:43:54,405 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:54,415 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-12-03 15:43:54,440 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:43:54,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 15:43:54,441 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:54,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:54,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:54,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:43:54,442 INFO L87 Difference]: Start difference. First operand 1321 states and 1847 transitions. Second operand 3 states. [2018-12-03 15:43:54,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:54,745 INFO L93 Difference]: Finished difference Result 2569 states and 3598 transitions. [2018-12-03 15:43:54,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:54,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-03 15:43:54,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:54,751 INFO L225 Difference]: With dead ends: 2569 [2018-12-03 15:43:54,751 INFO L226 Difference]: Without dead ends: 1107 [2018-12-03 15:43:54,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:43:54,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2018-12-03 15:43:54,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 700. [2018-12-03 15:43:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-12-03 15:43:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 946 transitions. [2018-12-03 15:43:54,879 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 946 transitions. Word has length 101 [2018-12-03 15:43:54,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:54,879 INFO L480 AbstractCegarLoop]: Abstraction has 700 states and 946 transitions. [2018-12-03 15:43:54,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:54,879 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 946 transitions. [2018-12-03 15:43:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:43:54,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:54,881 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:54,881 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:54,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1071152936, now seen corresponding path program 3 times [2018-12-03 15:43:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:54,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:54,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:54,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:54,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 131 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 15:43:55,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:55,151 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:55,151 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:55,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:55,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:55,152 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:55,164 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:43:55,164 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:43:55,235 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:43:55,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:43:55,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:55,342 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 15:43:55,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-12-03 15:43:55,479 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:43:55,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 5 [2018-12-03 15:43:55,479 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:55,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:55,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:55,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:43:55,480 INFO L87 Difference]: Start difference. First operand 700 states and 946 transitions. Second operand 3 states. [2018-12-03 15:43:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:55,730 INFO L93 Difference]: Finished difference Result 1320 states and 1793 transitions. [2018-12-03 15:43:55,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:55,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-03 15:43:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:55,734 INFO L225 Difference]: With dead ends: 1320 [2018-12-03 15:43:55,734 INFO L226 Difference]: Without dead ends: 636 [2018-12-03 15:43:55,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:43:55,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-12-03 15:43:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 612. [2018-12-03 15:43:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2018-12-03 15:43:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 812 transitions. [2018-12-03 15:43:55,907 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 812 transitions. Word has length 102 [2018-12-03 15:43:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:55,908 INFO L480 AbstractCegarLoop]: Abstraction has 612 states and 812 transitions. [2018-12-03 15:43:55,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:55,908 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 812 transitions. [2018-12-03 15:43:55,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:43:55,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:43:55,910 INFO L402 BasicCegarLoop]: trace histogram [9, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:43:55,910 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:43:55,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:43:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -740401578, now seen corresponding path program 4 times [2018-12-03 15:43:55,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:43:55,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:55,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:43:55,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:43:55,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:43:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 170 proven. 9 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 15:43:56,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:56,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:43:56,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:43:56,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:43:56,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:43:56,079 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:43:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:43:56,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:43:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:43:56,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:43:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 15:43:56,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:43:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 15:43:56,233 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 15:43:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [4] total 4 [2018-12-03 15:43:56,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:43:56,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:43:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:43:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:43:56,234 INFO L87 Difference]: Start difference. First operand 612 states and 812 transitions. Second operand 3 states. [2018-12-03 15:43:56,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:43:56,328 INFO L93 Difference]: Finished difference Result 644 states and 848 transitions. [2018-12-03 15:43:56,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:43:56,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-03 15:43:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:43:56,329 INFO L225 Difference]: With dead ends: 644 [2018-12-03 15:43:56,329 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 15:43:56,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:43:56,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 15:43:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 15:43:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 15:43:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 15:43:56,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2018-12-03 15:43:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:43:56,331 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 15:43:56,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:43:56,331 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 15:43:56,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 15:43:56,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 15:43:56,381 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,523 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,707 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,725 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,726 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,743 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,884 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,885 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,973 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:56,975 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,013 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,121 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,142 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,205 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,392 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,393 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,396 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,397 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,398 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,399 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,411 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,417 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,427 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,443 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,444 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:57,453 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 150 [2018-12-03 15:43:57,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 15:43:58,359 WARN L180 SmtUtils]: Spent 808.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-03 15:43:59,028 WARN L180 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 73 [2018-12-03 15:44:01,377 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2018-12-03 15:44:01,702 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-03 15:44:01,890 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 15:44:02,233 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-12-03 15:44:02,658 WARN L180 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 72 [2018-12-03 15:44:03,201 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2018-12-03 15:44:03,619 WARN L180 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 71 [2018-12-03 15:44:03,992 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 69 [2018-12-03 15:44:04,169 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 15:44:04,363 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 15:44:04,688 WARN L180 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 80 [2018-12-03 15:44:04,879 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 15:44:05,135 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2018-12-03 15:44:05,425 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2018-12-03 15:44:05,627 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 69 [2018-12-03 15:44:05,849 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2018-12-03 15:44:07,536 WARN L180 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-12-03 15:44:08,022 WARN L180 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2018-12-03 15:44:09,020 WARN L180 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2018-12-03 15:44:10,061 WARN L180 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2018-12-03 15:44:10,457 WARN L180 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 71 [2018-12-03 15:44:11,119 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 80 [2018-12-03 15:44:11,566 WARN L180 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 73 [2018-12-03 15:44:11,800 WARN L180 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2018-12-03 15:44:12,362 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 87 [2018-12-03 15:44:12,665 WARN L180 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2018-12-03 15:44:12,671 INFO L444 ceAbstractionStarter]: At program point L192(lines 166 192) the Hoare annotation is: (let ((.cse16 (= ~wl_st 0)) (.cse6 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse6)) (.cse2 (= ~wl_pc 2)) (.cse3 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse5 (<= 1 ~processed)) (.cse8 (<= .cse6 ~c)) (.cse10 (<= ~data .cse6)) (.cse12 (<= .cse6 ~data)) (.cse9 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse7 (<= 1 ~c2_pc)) (.cse13 (not (= ~e_c 0))) (.cse14 (not .cse16)) (.cse11 (<= 2 ~e_wl)) (.cse15 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 (<= .cse6 ~d) .cse9 .cse10 .cse11 (not (= ~r_st 0)) .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse15 .cse9 .cse1 .cse11 .cse7 .cse13 .cse14) (and .cse11 (<= ~t_b ~data) (and .cse16 (= ~t_b 0) (= ~d 0)) (<= ~data ~t_b) (let ((.cse17 (= ~e_f 2)) (.cse18 (= ~c_req_up 0)) (.cse19 (= ~r_st 2)) (.cse20 (= ~e_g 2)) (.cse21 (= ~e_c 2)) (.cse22 (= ~e_e 2)) (.cse23 (= ~c 0))) (or (and .cse17 .cse18 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse19 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse20 .cse21 .cse22 .cse23) (and .cse17 (= ~c1_st 2) .cse18 (= ~c2_pc 1) .cse19 .cse15 (= ~wb_pc 1) .cse20 .cse21 (= ~wb_st 2) (= ~c2_st 2) (= (mod ~e_wl 2) 0) .cse22 (= ~c1_pc 1) .cse23))))))) [2018-12-03 15:44:12,671 INFO L444 ceAbstractionStarter]: At program point L448(lines 445 454) the Hoare annotation is: (let ((.cse4 (<= 2 ~e_wl)) (.cse3 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0))) (.cse6 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) .cse3 (<= ~data .cse0) .cse4 (<= .cse0 ~data) .cse5 .cse6)) (and (<= ~t_b ~data) (= ~c2_pc 1) (<= ~data ~t_b) (= ~wl_pc 1) (= ~wb_pc 1) .cse4 (and (= ~e_g 2) (= ~e_c 2) (= ~e_f 2) (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2) (= ~e_e 2) (= ~r_st 2)) (= (mod ~e_wl 2) 0) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and .cse3 .cse1 (not (= ~r_st 0)) .cse2 .cse5 .cse6))) [2018-12-03 15:44:12,672 INFO L444 ceAbstractionStarter]: At program point L416(lines 416 423) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse3 (not (= ~r_st 0))) (.cse2 (<= 1 ~c2_pc)) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) .cse3 (<= .cse0 ~data) .cse4 .cse5)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 .cse3 .cse2 .cse4 .cse5))) [2018-12-03 15:44:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 53 461) no Hoare annotation was computed. [2018-12-03 15:44:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 53 461) no Hoare annotation was computed. [2018-12-03 15:44:12,672 INFO L444 ceAbstractionStarter]: At program point L408(lines 403 409) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse3 (not (= ~r_st 0))) (.cse2 (<= 1 ~c2_pc)) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) .cse3 (<= .cse0 ~data) .cse4 .cse5)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 .cse3 .cse2 .cse4 .cse5))) [2018-12-03 15:44:12,672 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 333) no Hoare annotation was computed. [2018-12-03 15:44:12,672 INFO L444 ceAbstractionStarter]: At program point L342(lines 339 388) the Hoare annotation is: (let ((.cse0 (<= 1 ~c1_pc)) (.cse3 (<= 1 ~c2_pc)) (.cse1 (<= 2 ~e_wl)) (.cse2 (not (= ~r_st 0))) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0))) (.cse6 (= ~wl_pc 1))) (or (and (not (= ~e_c 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse0 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse3 (<= .cse7 ~c) (<= ~data .cse7) .cse1 .cse2 (<= .cse7 ~data) .cse4 .cse5)) (= ~wl_pc 0) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)))) [2018-12-03 15:44:12,673 INFO L444 ceAbstractionStarter]: At program point L334(lines 296 340) the Hoare annotation is: (let ((.cse6 (= ~wl_pc 1)) (.cse1 (<= 1 ~c1_pc)) (.cse4 (<= 1 ~c2_pc)) (.cse0 (not (= ~e_c 1))) (.cse2 (<= 2 ~e_wl)) (.cse3 (not (= ~r_st 0))) (.cse5 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~e_c 0)) .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (= ~wl_pc 0) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse1 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse4 (<= .cse7 ~c) .cse0 (<= ~data .cse7) .cse2 .cse3 (<= .cse7 ~data) .cse5)))) [2018-12-03 15:44:12,673 INFO L444 ceAbstractionStarter]: At program point L425(lines 422 426) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse3 (not (= ~e_c 0))) (.cse4 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) (<= .cse0 ~data) .cse3 .cse4)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 (not (= ~r_st 0)) .cse2 .cse3 .cse4))) [2018-12-03 15:44:12,673 INFO L444 ceAbstractionStarter]: At program point L161(lines 161 167) the Hoare annotation is: (let ((.cse34 (= ~wl_st 0)) (.cse6 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse5 (<= 1 ~processed)) (.cse10 (<= ~data .cse6)) (.cse13 (<= .cse6 ~data)) (.cse23 (<= ~t_b ~data)) (.cse32 (= ~t_b 0)) (.cse33 (= ~d 0)) (.cse27 (<= ~data ~t_b)) (.cse17 (= ~e_f 2)) (.cse18 (= ~c1_st 2)) (.cse24 (= ~c_req_up 0)) (.cse25 (= ~c2_pc 1)) (.cse26 (= ~r_st 2)) (.cse16 (= ~wl_pc 1)) (.cse28 (= ~wb_pc 1)) (.cse29 (= ~e_g 2)) (.cse19 (= ~e_c 2)) (.cse20 (= ~wb_st 2)) (.cse30 (= ~c2_st 2)) (.cse21 (= ~e_e 2)) (.cse22 (= ~c1_pc 1)) (.cse31 (= ~c 0)) (.cse0 (<= ~c_t .cse6)) (.cse9 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~e_wl)) (.cse3 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse12 (not (= ~r_st 0))) (.cse7 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0))) (.cse8 (<= .cse6 ~c)) (.cse15 (not .cse34))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 (<= .cse6 ~d) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse16 .cse9 .cse1 .cse11 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse18 (= ~e_wl 0) .cse16 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= ~wl_st 2) .cse31 .cse32 .cse33) (and .cse11 .cse23 (and .cse34 .cse32 .cse33) .cse27 (or (and .cse17 .cse24 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse26 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse29 .cse19 .cse21 .cse31) (and .cse17 .cse18 .cse24 .cse25 .cse26 .cse16 .cse28 .cse29 .cse19 .cse20 .cse30 (= (mod ~e_wl 2) 0) .cse21 .cse22 .cse31))) (and .cse0 .cse9 .cse1 .cse11 .cse3 .cse4 .cse12 .cse7 .cse14 .cse8 .cse15)))) [2018-12-03 15:44:12,673 INFO L444 ceAbstractionStarter]: At program point L318(lines 307 343) the Hoare annotation is: (let ((.cse4 (= ~wb_st 0)) (.cse0 (= ~wl_pc 1)) (.cse9 (= ~wb_pc 1))) (let ((.cse3 (<= 2 ~e_wl)) (.cse1 (let ((.cse10 (= ~e_f 2)) (.cse11 (= ~c1_st 2)) (.cse12 (= ~c_req_up 0)) (.cse13 (= ~e_g 2)) (.cse14 (= ~e_c 2)) (.cse15 (= ~e_e 2)) (.cse16 (= ~wl_st 2)) (.cse17 (= ~c1_pc 1)) (.cse18 (= ~d 0))) (or (and .cse10 .cse11 .cse12 (= ~c2_pc 0) (= ~e_wl 0) .cse0 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse10 .cse11 .cse12 (= ~c2_pc 1) .cse9 .cse13 .cse14 (= (mod ~e_wl 2) 0) .cse15 .cse16 .cse17 .cse18)))) (.cse2 (let ((.cse6 (= ~c 0)) (.cse7 (= ~r_st 2)) (.cse8 (= ~t_b 0))) (or (and .cse0 .cse4 .cse6 .cse7 .cse8 (= ~wb_pc 0)) (and .cse9 (= ~wl_pc 2) .cse4 .cse6 .cse7 .cse8))))) (or (and .cse0 (<= ~t_b ~data) .cse1 (<= ~data ~t_b) .cse2) (and (and .cse0 (not (= ~e_c 1)) (<= 1 ~c1_pc) .cse3 .cse4 (<= 1 ~c2_pc) (not (= ~e_c 0))) (not (= ~wl_st 0))) (let ((.cse5 (+ ~t_b 2))) (and (<= ~data .cse5) .cse3 .cse1 .cse2 (<= .cse5 ~data)))))) [2018-12-03 15:44:12,674 INFO L444 ceAbstractionStarter]: At program point L302(lines 209 302) the Hoare annotation is: (let ((.cse14 (= ~wl_pc 2)) (.cse15 (= ~wl_pc 1)) (.cse23 (= ~wb_pc 1)) (.cse5 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse5)) (.cse2 (<= ~c .cse5)) (.cse3 (<= .cse5 ~c_t)) (.cse4 (<= 1 ~processed)) (.cse7 (<= .cse5 ~c)) (.cse9 (<= ~data .cse5)) (.cse11 (<= .cse5 ~data)) (.cse16 (let ((.cse24 (= ~e_f 2)) (.cse25 (= ~c1_st 2)) (.cse26 (= ~c_req_up 0)) (.cse27 (= ~c2_st 0)) (.cse28 (= ~e_g 2)) (.cse29 (= ~e_c 2)) (.cse30 (= ~e_e 2)) (.cse31 (= ~wl_st 2)) (.cse32 (= ~c1_pc 1)) (.cse33 (= ~d 0))) (or (and .cse24 .cse25 .cse26 (= ~c2_pc 0) (= ~e_wl 0) .cse27 .cse15 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33) (and .cse24 .cse25 .cse26 (= ~c2_pc 1) .cse27 .cse23 .cse28 .cse29 (= (mod ~e_wl 2) 0) .cse30 .cse31 .cse32 .cse33)))) (.cse17 (let ((.cse19 (= ~wb_st 0)) (.cse20 (= ~c 0)) (.cse21 (= ~r_st 2)) (.cse22 (= ~t_b 0))) (or (and .cse15 .cse19 .cse20 .cse21 .cse22 (= ~wb_pc 0)) (and .cse23 .cse14 .cse19 .cse20 .cse21 .cse22)))) (.cse8 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse10 (<= 2 ~e_wl)) (.cse6 (<= 1 ~c2_pc)) (.cse12 (not (= ~e_c 0))) (.cse13 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~d .cse5) .cse6 .cse7 (<= .cse5 ~d) .cse8 .cse9 .cse10 (not (= ~r_st 0)) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse14 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse15 .cse16 (<= ~t_b ~data) (<= ~data ~t_b) .cse17) (let ((.cse18 (+ ~t_b 1))) (and (<= ~data .cse18) .cse16 .cse10 (= ~processed 0) .cse17 (<= .cse18 ~data))) (and (and .cse15 .cse8 .cse1 .cse10 .cse6 .cse12) .cse13)))) [2018-12-03 15:44:12,674 INFO L444 ceAbstractionStarter]: At program point L360(lines 353 391) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2))) (let ((.cse2 (<= ~c .cse4)) (.cse6 (<= .cse4 ~c)) (.cse0 (<= ~c_t .cse4)) (.cse12 (= ~wl_pc 2)) (.cse3 (<= .cse4 ~c_t)) (.cse13 (<= 1 ~processed)) (.cse14 (<= ~data .cse4)) (.cse9 (not (= ~r_st 0))) (.cse15 (<= .cse4 ~data)) (.cse16 (= ~wl_pc 1)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse10 (not (= ~e_c 0))) (.cse11 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~d .cse4) .cse5 .cse6 (<= .cse4 ~d) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse13 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse10 .cse11) (and (<= ~t_b ~data) (<= ~data ~t_b) (and (= ~e_f 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (= ~wb_pc 0) (= ~e_g 2) (= ~e_c 2) (= ~c2_st 2) (= ~e_e 2) (= ~wl_st 2) (= ~c1_pc 1) (= ~c 0)) (= ~e_wl 0) .cse16 (= ~t_b 0) (= ~d 0)) (and .cse0 .cse1 .cse12 .cse3 .cse13 .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse10 .cse11) (and (and .cse16 .cse7 .cse1 .cse8 .cse5 .cse10) .cse11)))) [2018-12-03 15:44:12,674 INFO L444 ceAbstractionStarter]: At program point L220(lines 220 271) the Hoare annotation is: (let ((.cse0 (<= 2 ~e_wl)) (.cse1 (not (= ~wl_st 0)))) (or (and (<= ~t_b ~data) (= ~c2_pc 1) (<= ~data ~t_b) (= ~wl_pc 1) (= ~wb_pc 1) .cse0 (and (= ~e_g 2) (= ~e_c 2) (= ~e_f 2) (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2) (= ~e_e 2) (= ~r_st 2)) (= (mod ~e_wl 2) 0) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0) .cse1) (and (= ~wl_pc 2) (and (let ((.cse2 (+ ~t_b 2))) (and (<= .cse2 ~d) (not (= ~e_c 1)) (<= 1 ~c1_pc) .cse0 (not (= ~r_st 0)) (<= ~d .cse2) (<= 1 ~c2_pc) (not (= ~e_c 0)))) .cse1)))) [2018-12-03 15:44:12,674 INFO L444 ceAbstractionStarter]: At program point L187(lines 187 218) the Hoare annotation is: (let ((.cse5 (= ~c2_st 0))) (let ((.cse1 (<= 2 ~e_wl)) (.cse3 (<= ~t_b ~data)) (.cse6 (let ((.cse8 (= ~e_f 2)) (.cse9 (= ~c_req_up 0)) (.cse10 (= ~r_st 2)) (.cse11 (= ~e_g 2)) (.cse12 (= ~e_c 2)) (.cse13 (= ~e_e 2)) (.cse14 (= ~c 0)) (.cse15 (= ~d 0))) (or (and .cse8 .cse9 (= ~c1_st 0) (= ~wb_st 0) (= ~wl_pc 0) .cse10 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) .cse5 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse8 (= ~c1_st 2) .cse9 (= ~c2_pc 1) .cse10 (= ~wl_pc 1) (= ~wb_pc 1) .cse11 .cse12 (= ~wb_st 2) (= ~c2_st 2) .cse13 (= ~c1_pc 1) .cse14 .cse15)))) (.cse4 (<= ~data ~t_b)) (.cse7 (= ~t_b 0)) (.cse2 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) (<= 1 ~c1_pc) (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) (<= ~d .cse0) (<= 1 ~c2_pc) (<= .cse0 ~c) (<= .cse0 ~d) (not (= ~e_c 1)) (<= ~data .cse0) .cse1 (not (= ~r_st 0)) (<= .cse0 ~data) (not (= ~e_c 0)) .cse2)) (and .cse3 .cse4 .cse5 .cse1 .cse6 .cse7 .cse2) (and .cse1 .cse3 (= (mod ~e_wl 2) 0) .cse6 .cse4 .cse7 .cse2)))) [2018-12-03 15:44:12,674 INFO L444 ceAbstractionStarter]: At program point L270(lines 270 332) the Hoare annotation is: false [2018-12-03 15:44:12,675 INFO L444 ceAbstractionStarter]: At program point L460(lines 146 460) the Hoare annotation is: (let ((.cse8 (= ~wl_st 0))) (let ((.cse3 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse5 (not (= ~e_c 0))) (.cse6 (not .cse8)) (.cse4 (<= 2 ~e_wl)) (.cse7 (= ~wl_pc 1))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) .cse3 (<= ~data .cse0) .cse4 (<= .cse0 ~data) .cse5 .cse6)) (and .cse7 .cse3 .cse1 .cse4 .cse2 .cse5 .cse6) (and .cse4 (<= ~t_b ~data) (and .cse8 (= ~t_b 0) (= ~d 0)) (<= ~data ~t_b) (let ((.cse9 (= ~e_f 2)) (.cse10 (= ~c_req_up 0)) (.cse11 (= ~r_st 2)) (.cse12 (= ~e_g 2)) (.cse13 (= ~e_c 2)) (.cse14 (= ~e_e 2)) (.cse15 (= ~c 0))) (or (and .cse9 .cse10 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse11 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse12 .cse13 .cse14 .cse15) (and .cse9 (= ~c1_st 2) .cse10 (= ~c2_pc 1) .cse11 .cse7 (= ~wb_pc 1) .cse12 .cse13 (= ~wb_st 2) (= ~c2_st 2) (= (mod ~e_wl 2) 0) .cse14 (= ~c1_pc 1) .cse15))))))) [2018-12-03 15:44:12,675 INFO L444 ceAbstractionStarter]: At program point L328(lines 328 354) the Hoare annotation is: (let ((.cse14 (= ~wl_pc 1)) (.cse2 (= ~wl_pc 2)) (.cse13 (+ ~t_b 2))) (let ((.cse0 (<= ~c_t .cse13)) (.cse3 (<= ~c .cse13)) (.cse4 (<= .cse13 ~c_t)) (.cse6 (<= .cse13 ~c)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse5 (<= 1 ~c2_pc)) (.cse11 (not (= ~e_c 0))) (.cse12 (not (= ~wl_st 0))) (.cse8 (<= ~data .cse13)) (.cse9 (<= 2 ~e_wl)) (.cse15 (= ~t_b 0)) (.cse10 (<= .cse13 ~data)) (.cse16 (let ((.cse17 (= ~e_f 2)) (.cse18 (= ~c1_st 2)) (.cse19 (= ~c_req_up 0)) (.cse20 (= ~c2_pc 1)) (.cse21 (= ~r_st 2)) (.cse22 (= ~e_g 2)) (.cse23 (= ~e_c 2)) (.cse24 (= ~c2_st 2)) (.cse25 (= ~e_e 2)) (.cse26 (= ~wl_st 2)) (.cse27 (= ~c1_pc 1)) (.cse28 (= ~c 0)) (.cse29 (= ~d 0))) (or (and .cse17 .cse18 .cse19 .cse20 .cse21 (= ~wb_pc 0) (= ~e_wl 0) .cse14 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse2 .cse17 .cse18 .cse19 .cse20 .cse21 (= ~wb_pc 1) .cse22 .cse23 .cse24 (= (mod ~e_wl 2) 0) .cse25 .cse26 .cse27 .cse28 .cse29))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~processed) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse3 .cse4 (<= ~d .cse13) .cse5 .cse6 (<= .cse13 ~d) .cse7 .cse8 .cse9 (not (= ~r_st 0)) .cse10 .cse11 .cse12) (and (<= ~t_b ~data) (<= ~data ~t_b) .cse14 .cse15 .cse16) (and (and .cse14 .cse7 .cse1 .cse9 .cse5 .cse11) .cse12) (and .cse8 .cse9 .cse15 .cse10 .cse16)))) [2018-12-03 15:44:12,675 INFO L444 ceAbstractionStarter]: At program point L196(lines 196 226) the Hoare annotation is: (let ((.cse9 (+ ~t_b 2))) (let ((.cse1 (= ~wl_pc 1)) (.cse7 (<= ~c_t .cse9)) (.cse0 (not (= ~e_c 1))) (.cse2 (<= 1 ~c1_pc)) (.cse3 (<= 2 ~e_wl)) (.cse8 (<= .cse9 ~c_t)) (.cse4 (not (= ~r_st 0))) (.cse5 (<= 1 ~c2_pc)) (.cse6 (not (= ~e_c 0))) (.cse10 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse1 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and .cse7 .cse2 (= ~wl_pc 2) .cse8 (<= 1 ~processed) .cse5 .cse0 (<= ~data .cse9) .cse3 .cse4 (<= .cse9 ~data) .cse6 .cse10) (= ~wl_pc 0) (and .cse7 .cse0 .cse2 .cse3 (<= ~c .cse9) .cse8 .cse4 .cse5 .cse6 (<= .cse9 ~c) .cse10)))) [2018-12-03 15:44:12,675 INFO L444 ceAbstractionStarter]: At program point L172(lines 172 193) the Hoare annotation is: (let ((.cse16 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse5 (<= 1 ~processed)) (.cse9 (<= ~data .cse16)) (.cse11 (<= .cse16 ~data)) (.cse0 (<= ~c_t .cse16)) (.cse8 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse10 (<= 2 ~e_wl)) (.cse3 (<= ~c .cse16)) (.cse4 (<= .cse16 ~c_t)) (.cse15 (not (= ~r_st 0))) (.cse6 (<= 1 ~c2_pc)) (.cse12 (not (= ~e_c 0))) (.cse7 (<= .cse16 ~c)) (.cse13 (not (= ~wl_st 0))) (.cse14 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and .cse14 .cse8 .cse1 .cse10 .cse15 .cse6 .cse12) (and .cse14 .cse8 .cse1 .cse10 .cse6 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse15 .cse11 .cse12 .cse13) (and .cse0 .cse8 .cse1 .cse10 .cse3 .cse4 .cse15 .cse6 .cse12 .cse7 .cse13) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse14 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0))))) [2018-12-03 15:44:12,676 INFO L444 ceAbstractionStarter]: At program point L206(lines 206 238) the Hoare annotation is: (let ((.cse9 (= ~wb_st 0)) (.cse8 (= ~wl_pc 1))) (let ((.cse3 (not (= ~e_c 1))) (.cse4 (<= 1 ~c1_pc)) (.cse0 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse6 (not (= ~e_c 0))) (.cse7 (not (= ~wl_st 0))) (.cse1 (let ((.cse10 (= ~e_f 2)) (.cse11 (= ~c_req_up 0)) (.cse12 (= ~r_st 2)) (.cse13 (= ~c2_st 0)) (.cse14 (= ~e_g 2)) (.cse15 (= ~e_c 2)) (.cse16 (= ~e_e 2)) (.cse17 (= ~wl_st 2)) (.cse18 (= ~c 0)) (.cse19 (= ~d 0))) (or (and (= ~wl_pc 2) .cse10 .cse11 (= ~c2_pc 1) .cse12 .cse13 (= ~wb_pc 1) .cse14 .cse15 (= ~wb_st 2) (= (mod ~e_wl 2) 0) .cse16 .cse17 (= ~c1_pc 1) .cse18 .cse19) (and .cse10 .cse11 .cse9 .cse12 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~e_wl 0) .cse13 .cse8 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19)))) (.cse2 (= ~t_b 0))) (or (and (= ~data 0) .cse0 (= ~processed 0) .cse1 .cse2) (and .cse3 .cse4 (<= 1 ~processed) .cse5 .cse6 .cse7) (and (and .cse8 .cse3 .cse4 .cse0 .cse5 .cse6) .cse7) (and (<= ~t_b ~data) .cse1 .cse9 (<= ~data ~t_b) .cse2)))) [2018-12-03 15:44:12,676 INFO L444 ceAbstractionStarter]: At program point L396(lines 331 396) the Hoare annotation is: (let ((.cse4 (+ ~t_b 2))) (let ((.cse2 (<= ~c .cse4)) (.cse6 (<= .cse4 ~c)) (.cse0 (<= ~c_t .cse4)) (.cse12 (= ~wl_pc 2)) (.cse3 (<= .cse4 ~c_t)) (.cse13 (<= 1 ~processed)) (.cse14 (<= ~data .cse4)) (.cse9 (not (= ~r_st 0))) (.cse15 (<= .cse4 ~data)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse8 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse10 (not (= ~e_c 0))) (.cse11 (not (= ~wl_st 0))) (.cse16 (= ~wl_pc 1))) (or (and .cse0 .cse1 .cse2 .cse3 (<= ~d .cse4) .cse5 .cse6 (<= .cse4 ~d) .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse14 .cse8 .cse15 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse3 .cse13 .cse5 .cse7 .cse14 .cse8 .cse9 .cse15 .cse10 .cse11) (and (and .cse16 .cse7 .cse1 .cse8 .cse5 .cse10) .cse11) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse16 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0))))) [2018-12-03 15:44:12,676 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 53 461) no Hoare annotation was computed. [2018-12-03 15:44:12,676 INFO L444 ceAbstractionStarter]: At program point L248(lines 237 297) the Hoare annotation is: (let ((.cse3 (= ~wl_pc 1)) (.cse6 (= ~wb_st 0)) (.cse11 (= ~wl_pc 2)) (.cse1 (= ~wb_pc 0))) (let ((.cse4 (<= 1 ~c1_pc)) (.cse0 (let ((.cse12 (= ~c2_st 0)) (.cse13 (= ~e_g 2)) (.cse14 (= ~e_c 2)) (.cse15 (= ~e_f 2)) (.cse16 (= ~c_req_up 0)) (.cse17 (= ~e_e 2)) (.cse18 (= ~wl_st 2)) (.cse19 (= ~d 0))) (or (and .cse12 .cse13 .cse14 .cse11 .cse15 .cse16 (= (mod ~e_wl 2) 0) .cse17 .cse18 (= ~c2_pc 1) .cse19) (and .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= ~c2_pc 0) .cse1 .cse19 (= ~e_wl 0))))) (.cse5 (<= 2 ~e_wl)) (.cse2 (let ((.cse8 (= ~c 0)) (.cse9 (= ~r_st 2)) (.cse10 (= ~t_b 0))) (or (and .cse3 .cse6 .cse8 .cse9 .cse10 .cse1) (and (= ~wb_pc 1) .cse11 .cse6 .cse8 .cse9 .cse10))))) (or (and (<= ~t_b ~data) .cse0 (and (= ~c1_pc 0) .cse1) (<= ~data ~t_b) .cse2) (and (and .cse3 (not (= ~e_c 1)) .cse4 .cse5 .cse6 (<= 1 ~c2_pc) (not (= ~e_c 0))) (not (= ~wl_st 0))) (let ((.cse7 (+ ~t_b 1))) (and .cse4 .cse0 (<= ~data .cse7) .cse5 (= ~processed 0) .cse2 (<= .cse7 ~data)))))) [2018-12-03 15:44:12,676 INFO L444 ceAbstractionStarter]: At program point L430(lines 430 437) the Hoare annotation is: (let ((.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse3 (not (= ~e_c 0))) (.cse4 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) (<= ~data .cse0) (<= 2 ~e_wl) (<= .cse0 ~data) .cse3 .cse4)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and (not (= ~e_c 1)) .cse1 (not (= ~r_st 0)) .cse2 .cse3 .cse4))) [2018-12-03 15:44:12,677 INFO L444 ceAbstractionStarter]: At program point L232(lines 225 291) the Hoare annotation is: (let ((.cse6 (= ~wl_pc 1)) (.cse1 (<= 1 ~c1_pc)) (.cse4 (<= 1 ~c2_pc)) (.cse0 (not (= ~e_c 1))) (.cse2 (<= 2 ~e_wl)) (.cse3 (not (= ~r_st 0))) (.cse5 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (not (= ~e_c 0)) .cse5) (and .cse0 .cse6 .cse1 .cse2 .cse3 .cse4) (= ~wl_pc 0) (and (= ~e_f 2) (= ~c1_st 2) (= ~e_wl 0) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (<= ~data ~t_b) (= ~r_st 2) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~wl_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0)) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse1 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse4 (<= .cse7 ~c) .cse0 (<= ~data .cse7) .cse2 .cse3 (<= .cse7 ~data) .cse5)))) [2018-12-03 15:44:12,677 INFO L444 ceAbstractionStarter]: At program point L290(lines 177 290) the Hoare annotation is: (let ((.cse5 (+ ~t_b 2)) (.cse18 (= ~wl_pc 1)) (.cse19 (= ~wl_pc 2))) (let ((.cse14 (= ~c1_st 0)) (.cse15 (= ~c2_st 0)) (.cse16 (let ((.cse20 (= ~e_f 2)) (.cse21 (= ~c_req_up 0)) (.cse22 (= ~r_st 2)) (.cse23 (= ~e_g 2)) (.cse24 (= ~e_c 2)) (.cse25 (= ~e_e 2)) (.cse26 (= ~wl_st 2)) (.cse27 (= ~c 0)) (.cse28 (= ~d 0))) (or (and .cse20 .cse21 (= ~wb_st 0) .cse22 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~e_wl 0) .cse18 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse19 .cse20 .cse21 (= ~c2_pc 1) .cse22 (= ~wb_pc 1) .cse23 .cse24 (= ~wb_st 2) (= (mod ~e_wl 2) 0) .cse25 .cse26 (= ~c1_pc 1) .cse27 .cse28)))) (.cse17 (= ~t_b 0)) (.cse0 (<= ~c_t .cse5)) (.cse2 (<= ~c .cse5)) (.cse3 (<= .cse5 ~c_t)) (.cse4 (<= 1 ~processed)) (.cse7 (<= .cse5 ~c)) (.cse9 (<= ~data .cse5)) (.cse11 (<= .cse5 ~data)) (.cse8 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse10 (<= 2 ~e_wl)) (.cse6 (<= 1 ~c2_pc)) (.cse12 (not (= ~e_c 0))) (.cse13 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~d .cse5) .cse6 .cse7 (<= .cse5 ~d) .cse8 .cse9 .cse10 (not (= ~r_st 0)) .cse11 .cse12 .cse13) (and .cse14 (= ~data 0) .cse15 (= ~processed 0) .cse10 .cse16 .cse17) (and (<= ~t_b ~data) .cse14 (<= ~data ~t_b) .cse15 .cse18 .cse16 .cse17) (and .cse0 .cse1 .cse19 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) (and (and .cse18 .cse8 .cse1 .cse10 .cse6 .cse12) .cse13)))) [2018-12-03 15:44:12,677 INFO L444 ceAbstractionStarter]: At program point L381(lines 157 381) the Hoare annotation is: (let ((.cse34 (= ~wl_st 0)) (.cse6 (+ ~t_b 2))) (let ((.cse2 (= ~wl_pc 2)) (.cse5 (<= 1 ~processed)) (.cse10 (<= ~data .cse6)) (.cse13 (<= .cse6 ~data)) (.cse23 (<= ~t_b ~data)) (.cse32 (= ~t_b 0)) (.cse33 (= ~d 0)) (.cse27 (<= ~data ~t_b)) (.cse17 (= ~e_f 2)) (.cse18 (= ~c1_st 2)) (.cse24 (= ~c_req_up 0)) (.cse25 (= ~c2_pc 1)) (.cse26 (= ~r_st 2)) (.cse16 (= ~wl_pc 1)) (.cse28 (= ~wb_pc 1)) (.cse29 (= ~e_g 2)) (.cse19 (= ~e_c 2)) (.cse20 (= ~wb_st 2)) (.cse30 (= ~c2_st 2)) (.cse21 (= ~e_e 2)) (.cse22 (= ~c1_pc 1)) (.cse31 (= ~c 0)) (.cse0 (<= ~c_t .cse6)) (.cse9 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse11 (<= 2 ~e_wl)) (.cse3 (<= ~c .cse6)) (.cse4 (<= .cse6 ~c_t)) (.cse12 (not (= ~r_st 0))) (.cse7 (<= 1 ~c2_pc)) (.cse14 (not (= ~e_c 0))) (.cse8 (<= .cse6 ~c)) (.cse15 (not .cse34))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ~d .cse6) .cse7 .cse8 (<= .cse6 ~d) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse13 .cse14 .cse15) (and .cse16 .cse9 .cse1 .cse11 .cse7 .cse14 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15) (and .cse17 .cse18 (= ~e_wl 0) .cse16 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 (= ~wl_st 2) .cse31 .cse32 .cse33) (and .cse11 .cse23 (and .cse34 .cse32 .cse33) .cse27 (or (and .cse17 .cse24 (= ~c1_st 0) (= ~wb_st 0) (= ~e_wl 2) (= ~wl_pc 0) .cse26 (= ~c1_pc 0) (= ~c2_pc 0) (= ~wb_pc 0) (= ~c2_st 0) .cse29 .cse19 .cse21 .cse31) (and .cse17 .cse18 .cse24 .cse25 .cse26 .cse16 .cse28 .cse29 .cse19 .cse20 .cse30 (= (mod ~e_wl 2) 0) .cse21 .cse22 .cse31))) (and .cse0 .cse9 .cse1 .cse11 .cse3 .cse4 .cse12 .cse7 .cse14 .cse8 .cse15)))) [2018-12-03 15:44:12,678 INFO L444 ceAbstractionStarter]: At program point L348(lines 261 348) the Hoare annotation is: (let ((.cse17 (+ ~t_b 2)) (.cse16 (= ~wl_pc 1)) (.cse2 (= ~wl_pc 2))) (let ((.cse13 (= ~wb_st 0)) (.cse14 (= ~t_b 0)) (.cse15 (let ((.cse18 (= ~e_f 2)) (.cse19 (= ~c1_st 2)) (.cse20 (= ~c_req_up 0)) (.cse21 (= ~c2_pc 1)) (.cse22 (= ~r_st 2)) (.cse23 (= ~e_g 2)) (.cse24 (= ~e_c 2)) (.cse25 (= ~c2_st 2)) (.cse26 (= ~e_e 2)) (.cse27 (= ~wl_st 2)) (.cse28 (= ~c1_pc 1)) (.cse29 (= ~c 0)) (.cse30 (= ~d 0))) (or (and .cse18 .cse19 .cse20 .cse21 .cse22 (= ~wb_pc 0) (= ~e_wl 0) .cse16 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (and .cse2 .cse18 .cse19 .cse20 .cse21 .cse22 (= ~wb_pc 1) .cse23 .cse24 .cse25 (= (mod ~e_wl 2) 0) .cse26 .cse27 .cse28 .cse29 .cse30)))) (.cse0 (<= ~c_t .cse17)) (.cse3 (<= ~c .cse17)) (.cse4 (<= .cse17 ~c_t)) (.cse6 (<= .cse17 ~c)) (.cse8 (<= ~data .cse17)) (.cse10 (<= .cse17 ~data)) (.cse7 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse9 (<= 2 ~e_wl)) (.cse5 (<= 1 ~c2_pc)) (.cse11 (not (= ~e_c 0))) (.cse12 (not (= ~wl_st 0)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 1 ~processed) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse8 .cse9 (and .cse13 .cse14) .cse15 .cse10) (and (<= ~t_b ~data) .cse13 (<= ~data ~t_b) .cse16 .cse14 .cse15) (and .cse0 .cse1 .cse3 .cse4 (<= ~d .cse17) .cse5 .cse6 (<= .cse17 ~d) .cse7 .cse8 .cse9 (not (= ~r_st 0)) .cse10 .cse11 .cse12) (and (and .cse16 .cse7 .cse1 .cse9 .cse5 .cse11) .cse12)))) [2018-12-03 15:44:12,678 INFO L444 ceAbstractionStarter]: At program point L439(lines 436 446) the Hoare annotation is: (let ((.cse3 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (let ((.cse0 (+ ~t_b 2))) (and (<= ~c_t .cse0) .cse1 (= ~wl_pc 2) (<= ~c .cse0) (<= .cse0 ~c_t) (<= 1 ~processed) .cse2 (<= .cse0 ~c) .cse3 (<= ~data .cse0) (<= 2 ~e_wl) (<= .cse0 ~data) .cse4 .cse5)) (and (= ~e_f 2) (<= ~t_b ~data) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wl_pc 1) (= ~wb_pc 1) (= ~e_g 2) (= ~e_c 2) (and (= ~wb_st 2) (= ~c1_st 2) (= ~c_req_up 0) (= ~c2_st 2)) (= ~e_e 2) (= ~c1_pc 1) (= ~c 0) (= ~t_b 0) (= ~d 0)) (and .cse3 .cse1 (not (= ~r_st 0)) .cse2 .cse4 .cse5))) [2018-12-03 15:44:12,678 INFO L444 ceAbstractionStarter]: At program point L390(lines 387 404) the Hoare annotation is: (let ((.cse6 (= ~wl_pc 1)) (.cse0 (<= 1 ~c1_pc)) (.cse3 (<= 1 ~c2_pc)) (.cse1 (<= 2 ~e_wl)) (.cse2 (not (= ~r_st 0))) (.cse4 (not (= ~e_c 0))) (.cse5 (not (= ~wl_st 0)))) (or (and (not (= ~e_c 1)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ~e_f 2) (= ~c1_st 2) .cse6 (= ~e_c 2) (= ~wb_st 2) (= ~e_e 2) (= ~c1_pc 1) (= (mod ~wl_st 2) 0) (<= ~t_b ~data) (= ~c_req_up 0) (= ~c2_pc 1) (= ~r_st 2) (<= ~data ~t_b) (= ~e_wl 1) (= ~wb_pc 1) (= ~e_g 2) (= ~c2_st 2) (= ~c 0) (= ~t_b 0) (= ~d 0) .cse5) (and .cse6 .cse0 .cse1 .cse2 .cse3 .cse4) (let ((.cse7 (+ ~t_b 2))) (and (<= ~c_t .cse7) .cse0 (= ~wl_pc 2) (<= ~c .cse7) (<= .cse7 ~c_t) (<= 1 ~processed) .cse3 (<= .cse7 ~c) (<= ~data .cse7) .cse1 .cse2 (<= .cse7 ~data) .cse4 .cse5)) (= ~wl_pc 0))) [2018-12-03 15:44:12,679 INFO L444 ceAbstractionStarter]: At program point L258(lines 258 308) the Hoare annotation is: (let ((.cse5 (= ~wl_pc 1)) (.cse14 (= ~wb_pc 1))) (let ((.cse0 (not (= ~e_c 1))) (.cse1 (<= 1 ~c1_pc)) (.cse2 (<= 1 ~c2_pc)) (.cse3 (not (= ~e_c 0))) (.cse4 (not (= ~wl_st 0))) (.cse6 (<= 2 ~e_wl)) (.cse7 (let ((.cse15 (= ~e_f 2)) (.cse16 (= ~c1_st 2)) (.cse17 (= ~c_req_up 0)) (.cse18 (= ~e_g 2)) (.cse19 (= ~e_c 2)) (.cse20 (= ~e_e 2)) (.cse21 (= ~wl_st 2)) (.cse22 (= ~c1_pc 1)) (.cse23 (= ~d 0))) (or (and .cse15 .cse16 .cse17 (= ~c2_pc 0) (= ~e_wl 0) .cse5 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23) (and .cse15 .cse16 .cse17 (= ~c2_pc 1) .cse14 .cse18 .cse19 (= (mod ~e_wl 2) 0) .cse20 .cse21 .cse22 .cse23)))) (.cse8 (let ((.cse10 (= ~wb_st 0)) (.cse11 (= ~c 0)) (.cse12 (= ~r_st 2)) (.cse13 (= ~t_b 0))) (or (and .cse5 .cse10 .cse11 .cse12 .cse13 (= ~wb_pc 0)) (and .cse14 (= ~wl_pc 2) .cse10 .cse11 .cse12 .cse13))))) (or (and (<= 1 ~processed) (and (and .cse0 .cse1 .cse2 .cse3) .cse4)) (and .cse5 .cse0 .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse5 (<= ~t_b ~data) .cse7 (<= ~data ~t_b) .cse8) (let ((.cse9 (+ ~t_b 1))) (and (= ~processed 0) (<= ~data .cse9) .cse6 .cse7 .cse8 (<= .cse9 ~data)))))) [2018-12-03 15:44:12,733 INFO L202 PluginConnector]: Adding new model toy.cil.c_34.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:44:12 BoogieIcfgContainer [2018-12-03 15:44:12,733 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:44:12,734 INFO L168 Benchmark]: Toolchain (without parser) took 39629.41 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: -955.0 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:44:12,735 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:44:12,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.55 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:44:12,736 INFO L168 Benchmark]: Boogie Preprocessor took 59.86 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:44:12,737 INFO L168 Benchmark]: RCFGBuilder took 698.36 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:44:12,738 INFO L168 Benchmark]: TraceAbstraction took 38822.11 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -986.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-12-03 15:44:12,741 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.55 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 59.86 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 698.36 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 38822.11 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -986.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 333]: 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: 296]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((!(~e_c == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc)) || ~wl_pc == 0) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~wl_st == 0)) - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0))) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && 2 <= ~e_wl) && !(~r_st == 0)) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) - InvariantResult [Line: 225]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((!(~e_c == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc)) || ~wl_pc == 0) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~wl_st == 0)) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 307]: Loop Invariant Derived loop invariant: (((((~wl_pc == 1 && ~t_b <= ~data) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) || (((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~data <= ~t_b + 2 && 2 <= ~e_wl) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 2 <= ~data) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && 2 <= ~e_wl) && !(~r_st == 0)) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~t_b <= ~data && ~data <= ~t_b) && (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~t_b == 0) && ~d == 0)) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 177]: Loop Invariant Derived loop invariant: ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~c1_st == 0 && ~data == 0) && ~c2_st == 0) && ~processed == 0) && 2 <= ~e_wl) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b == 0)) || ((((((~t_b <= ~data && ~c1_st == 0) && ~data <= ~t_b) && ~c2_st == 0) && ~wl_pc == 1) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 237]: Loop Invariant Derived loop invariant: (((((~t_b <= ~data && (((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~wl_pc == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 1) && ~d == 0) || ((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 0) && ~wb_pc == 0) && ~d == 0) && ~e_wl == 0))) && ~c1_pc == 0 && ~wb_pc == 0) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) || (((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~wb_st == 0) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((1 <= ~c1_pc && (((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~wl_pc == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 1) && ~d == 0) || ((((((((((~c2_st == 0 && ~e_g == 2) && ~e_c == 2) && ~e_f == 2) && ~c_req_up == 0) && ~e_e == 2) && ~wl_st == 2) && ~c2_pc == 0) && ~wb_pc == 0) && ~d == 0) && ~e_wl == 0))) && ~data <= ~t_b + 1) && 2 <= ~e_wl) && ~processed == 0) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 1 <= ~data) - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: ((((((~data == 0 && 2 <= ~e_wl) && ~processed == 0) && ((((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0))) && ~t_b == 0) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~t_b <= ~data && ((((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~wb_st == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c == 0) && ~d == 0))) && ~wb_st == 0) && ~data <= ~t_b) && ~t_b == 0) - InvariantResult [Line: 270]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 187]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~t_b <= ~data && ~data <= ~t_b) && ~c2_st == 0) && 2 <= ~e_wl) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b == 0) && !(~wl_st == 0))) || ((((((2 <= ~e_wl && ~t_b <= ~data) && ~e_wl % 2 == 0) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) && ~d == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~data <= ~t_b) && ~t_b == 0) && !(~wl_st == 0)) - InvariantResult [Line: 403]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: ((((((((((((~t_b <= ~data && ~c2_pc == 1) && ~data <= ~t_b) && ~wl_pc == 1) && ~wb_pc == 1) && 2 <= ~e_wl) && (((((((~e_g == 2 && ~e_c == 2) && ~e_f == 2) && ~wb_st == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~r_st == 2) && ~e_wl % 2 == 0) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0) && !(~wl_st == 0)) || (~wl_pc == 2 && (((((((~t_b + 2 <= ~d && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 436]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 339]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((~wl_pc == 1 && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ~wl_pc == 0) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) - InvariantResult [Line: 445]: Loop Invariant Derived loop invariant: ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((~t_b <= ~data && ~c2_pc == 1) && ~data <= ~t_b) && ~wl_pc == 1) && ~wb_pc == 1) && 2 <= ~e_wl) && (((((((~e_g == 2 && ~e_c == 2) && ~e_f == 2) && ~wb_st == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~r_st == 2) && ~e_wl % 2 == 0) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((((~e_f == 2 && ~t_b <= ~data) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ((~wb_st == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0) && ~t_b == 0) && ~d == 0)) || (((((!(~e_c == 1) && 1 <= ~c1_pc) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0))) - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~t_b <= ~data && ~data <= ~t_b) && ~wl_pc == 1) && ~t_b == 0) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0)))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~data <= ~t_b + 2 && 2 <= ~e_wl) && ~t_b == 0) && ~t_b + 2 <= ~data) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) - InvariantResult [Line: 157]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0)))) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0)) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || ((((2 <= ~e_wl && ~t_b <= ~data) && (~wl_st == 0 && ~t_b == 0) && ~d == 0) && ~data <= ~t_b) && (((((((((((((((~e_f == 2 && ~c_req_up == 0) && ~c1_st == 0) && ~wb_st == 0) && ~e_wl == 2) && ~wl_pc == 0) && ~r_st == 2) && ~c1_pc == 0) && ~c2_pc == 0) && ~wb_pc == 0) && ~c2_st == 0) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~c == 0) || ((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wl_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~wb_st == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~c1_pc == 1) && ~c == 0)))) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0)) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0))) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((~data <= ~t_b + 2 && 2 <= ~e_wl) && ~wb_st == 0 && ~t_b == 0) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0))) && ~t_b + 2 <= ~data)) || (((((~t_b <= ~data && ~wb_st == 0) && ~data <= ~t_b) && ~wl_pc == 1) && ~t_b == 0) && ((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0) || (((((((((((((((~wl_pc == 2 && ~e_f == 2) && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~c2_st == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~c == 0) && ~d == 0)))) || ((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 258]: Loop Invariant Derived loop invariant: (((1 <= ~processed && (((!(~e_c == 1) && 1 <= ~c1_pc) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~wl_pc == 1 && ~t_b <= ~data) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0)))) || (((((~processed == 0 && ~data <= ~t_b + 1) && 2 <= ~e_wl) && ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || (((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 1 <= ~data) - InvariantResult [Line: 387]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) || ((((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~wl_st % 2 == 0) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~r_st == 2) && ~data <= ~t_b) && ~e_wl == 1) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0) && !(~wl_st == 0))) || (((((~wl_pc == 1 && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0))) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ~wl_pc == 0 - InvariantResult [Line: 209]: Loop Invariant Derived loop invariant: ((((((((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && ~d <= ~t_b + 2) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && ~t_b + 2 <= ~d) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0)) || (((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && ~t_b + 2 <= ~c) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ((((~wl_pc == 1 && (((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && ~t_b <= ~data) && ~data <= ~t_b) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0)))) || (((((~data <= ~t_b + 1 && (((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 0) && ~e_wl == 0) && ~c2_st == 0) && ~wl_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0) || ((((((((((((~e_f == 2 && ~c1_st == 2) && ~c_req_up == 0) && ~c2_pc == 1) && ~c2_st == 0) && ~wb_pc == 1) && ~e_g == 2) && ~e_c == 2) && ~e_wl % 2 == 0) && ~e_e == 2) && ~wl_st == 2) && ~c1_pc == 1) && ~d == 0))) && 2 <= ~e_wl) && ~processed == 0) && ((((((~wl_pc == 1 && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0) && ~wb_pc == 0) || (((((~wb_pc == 1 && ~wl_pc == 2) && ~wb_st == 0) && ~c == 0) && ~r_st == 2) && ~t_b == 0))) && ~t_b + 1 <= ~data)) || ((((((~wl_pc == 1 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && 1 <= ~c2_pc) && !(~e_c == 0)) && !(~wl_st == 0)) - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: (((((((((!(~e_c == 1) && ~wl_pc == 1) && 1 <= ~c1_pc) && 2 <= ~e_wl) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) || (((((((((((((((((((~e_f == 2 && ~c1_st == 2) && ~e_wl == 0) && ~wl_pc == 1) && ~e_c == 2) && ~wb_st == 2) && ~e_e == 2) && ~c1_pc == 1) && ~t_b <= ~data) && ~c_req_up == 0) && ~c2_pc == 1) && ~data <= ~t_b) && ~r_st == 2) && ~wb_pc == 1) && ~e_g == 2) && ~c2_st == 2) && ~wl_st == 2) && ~c == 0) && ~t_b == 0) && ~d == 0)) || ((((((((((((~c_t <= ~t_b + 2 && 1 <= ~c1_pc) && ~wl_pc == 2) && ~t_b + 2 <= ~c_t) && 1 <= ~processed) && 1 <= ~c2_pc) && !(~e_c == 1)) && ~data <= ~t_b + 2) && 2 <= ~e_wl) && !(~r_st == 0)) && ~t_b + 2 <= ~data) && !(~e_c == 0)) && !(~wl_st == 0))) || ~wl_pc == 0) || ((((((((((~c_t <= ~t_b + 2 && !(~e_c == 1)) && 1 <= ~c1_pc) && 2 <= ~e_wl) && ~c <= ~t_b + 2) && ~t_b + 2 <= ~c_t) && !(~r_st == 0)) && 1 <= ~c2_pc) && !(~e_c == 0)) && ~t_b + 2 <= ~c) && !(~wl_st == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 38.7s OverallTime, 17 OverallIterations, 9 TraceHistogramMax, 13.8s AutomataDifference, 0.0s DeadEndRemovalTime, 16.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 999 SDtfs, 921 SDslu, 1440 SDs, 0 SdLazy, 1100 SolverSat, 144 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 908 GetRequests, 816 SyntacticMatches, 3 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1321occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 2 AbstIntIterations, 1 AbstIntStrong, 0.953083009663306 AbsIntWeakeningRatio, 1.3333333333333333 AbsIntAvgWeakeningVarsNumRemoved, 6.2745098039215685 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 17 MinimizatonAttempts, 1154 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 29 PreInvPairs, 355 NumberOfFragments, 6957 HoareAnnotationTreeSize, 29 FomulaSimplifications, 28166 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 29 FomulaSimplificationsInter, 7903 FormulaSimplificationTreeSizeReductionInter, 15.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1269 NumberOfCodeBlocks, 1186 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1635 ConstructedInterpolants, 0 QuantifiedInterpolants, 303873 SizeOfPredicates, 10 NumberOfNonLiveVariables, 1617 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 25 InterpolantComputations, 18 PerfectInterpolantSequences, 1982/2033 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...