java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:34:59,923 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:34:59,925 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:34:59,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:34:59,937 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:34:59,938 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:34:59,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:34:59,941 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:34:59,943 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:34:59,944 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:34:59,945 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:34:59,945 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:34:59,946 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:34:59,947 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:34:59,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:34:59,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:34:59,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:34:59,956 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:34:59,958 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:34:59,959 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:34:59,961 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:34:59,962 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:34:59,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:34:59,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:34:59,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:34:59,972 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:34:59,973 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:34:59,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:34:59,974 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:34:59,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:34:59,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:34:59,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:34:59,981 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:34:59,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:34:59,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:34:59,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:34:59,985 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:35:00,001 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:35:00,001 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:35:00,005 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:35:00,006 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:35:00,006 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:35:00,006 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:35:00,006 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:35:00,007 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:35:00,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:35:00,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:35:00,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:35:00,077 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:35:00,078 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:35:00,079 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2018-07-25 13:35:00,079 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2018-07-25 13:35:00,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:35:00,136 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:35:00,137 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:35:00,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:35:00,137 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:35:00,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:35:00,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:35:00,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:35:00,196 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:35:00,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:35:00,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:35:00,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:35:00,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:35:00,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/1) ... [2018-07-25 13:35:00,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:35:00,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:35:00,533 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:35:00,534 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:35:00 BoogieIcfgContainer [2018-07-25 13:35:00,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:35:00,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:35:00,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:35:00,539 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:35:00,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:00" (1/2) ... [2018-07-25 13:35:00,541 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8329cd and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:35:00, skipping insertion in model container [2018-07-25 13:35:00,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:35:00" (2/2) ... [2018-07-25 13:35:00,543 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2018-07-25 13:35:00,553 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:35:00,562 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-07-25 13:35:00,609 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:35:00,610 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:35:00,610 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:35:00,610 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:35:00,611 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:35:00,611 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:35:00,611 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:35:00,611 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:35:00,611 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:35:00,626 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-07-25 13:35:00,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:35:00,636 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:00,637 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:35:00,639 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1853097, now seen corresponding path program 1 times [2018-07-25 13:35:00,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:00,733 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:35:00,734 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:35:00,739 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:35:00,751 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:35:00,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:35:00,754 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 4 states. [2018-07-25 13:35:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:00,819 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-07-25 13:35:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:35:00,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:35:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:00,834 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:35:00,834 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:35:00,839 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:35:00,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:35:00,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2018-07-25 13:35:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:35:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-07-25 13:35:00,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-07-25 13:35:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:00,878 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-07-25 13:35:00,879 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:35:00,879 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-07-25 13:35:00,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:35:00,879 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:00,880 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-07-25 13:35:00,880 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:00,880 INFO L82 PathProgramCache]: Analyzing trace with hash 57446050, now seen corresponding path program 1 times [2018-07-25 13:35:00,881 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:00,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:00,963 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:35:00,967 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:35:00,969 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:35:00,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:35:00,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:35:00,974 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2018-07-25 13:35:01,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:01,092 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2018-07-25 13:35:01,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:35:01,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:35:01,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:01,096 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:35:01,097 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:35:01,098 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:35:01,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:35:01,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2018-07-25 13:35:01,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:35:01,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-07-25 13:35:01,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2018-07-25 13:35:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:01,108 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-07-25 13:35:01,108 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:35:01,108 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-07-25 13:35:01,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:35:01,109 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:01,109 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-07-25 13:35:01,110 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:01,110 INFO L82 PathProgramCache]: Analyzing trace with hash -2135835182, now seen corresponding path program 1 times [2018-07-25 13:35:01,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:01,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:01,128 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:35:01,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-25 13:35:01,128 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:35:01,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:35:01,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:35:01,129 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2018-07-25 13:35:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:01,147 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-07-25 13:35:01,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:35:01,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-07-25 13:35:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:01,148 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:35:01,148 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:35:01,149 INFO L574 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-07-25 13:35:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:35:01,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:35:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:35:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:35:01,156 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:35:01,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:01,156 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:35:01,157 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:35:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:35:01,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:35:01,157 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:01,158 INFO L354 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2018-07-25 13:35:01,158 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:01,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1483937226, now seen corresponding path program 1 times [2018-07-25 13:35:01,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:01,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:01,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:35:01,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:35:01,273 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:35:01,273 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:35:01,274 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2018-07-25 13:35:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:01,359 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:35:01,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:35:01,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-07-25 13:35:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:01,364 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:35:01,364 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:35:01,365 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:35:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:35:01,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-07-25 13:35:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:35:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:35:01,387 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-07-25 13:35:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:01,388 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:35:01,388 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:35:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:35:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:35:01,389 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:01,389 INFO L354 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2018-07-25 13:35:01,389 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:01,390 INFO L82 PathProgramCache]: Analyzing trace with hash -587551966, now seen corresponding path program 2 times [2018-07-25 13:35:01,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:01,462 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:01,462 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:35:01,463 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:35:01,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:35:01,463 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:35:01,464 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 8 states. [2018-07-25 13:35:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:01,599 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:35:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:35:01,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-07-25 13:35:01,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:01,601 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:35:01,601 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:35:01,602 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:35:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:35:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-07-25 13:35:01,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:35:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:35:01,621 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-07-25 13:35:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:01,624 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:35:01,624 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:35:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:35:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:35:01,625 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:01,625 INFO L354 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2018-07-25 13:35:01,626 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:01,626 INFO L82 PathProgramCache]: Analyzing trace with hash 953982390, now seen corresponding path program 3 times [2018-07-25 13:35:01,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:01,740 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:01,740 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:35:01,740 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:35:01,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:35:01,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:35:01,742 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 9 states. [2018-07-25 13:35:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:01,878 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:35:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:35:01,878 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2018-07-25 13:35:01,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:01,885 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:35:01,885 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:35:01,887 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:35:01,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:35:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-07-25 13:35:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:35:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:35:01,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-07-25 13:35:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:01,912 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:35:01,912 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:35:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:35:01,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:35:01,916 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:01,917 INFO L354 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2018-07-25 13:35:01,917 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash 317663138, now seen corresponding path program 4 times [2018-07-25 13:35:01,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:01,997 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:01,997 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:35:01,998 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:35:01,998 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:35:01,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:35:01,999 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-07-25 13:35:02,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:02,112 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:35:02,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:35:02,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-07-25 13:35:02,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:02,114 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:35:02,114 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:35:02,115 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:35:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:35:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-07-25 13:35:02,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:35:02,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:35:02,136 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-07-25 13:35:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:02,138 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:35:02,138 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:35:02,138 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:35:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:35:02,139 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:02,140 INFO L354 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2018-07-25 13:35:02,140 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:02,142 INFO L82 PathProgramCache]: Analyzing trace with hash 247591222, now seen corresponding path program 5 times [2018-07-25 13:35:02,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:02,230 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:02,230 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:35:02,231 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:35:02,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:35:02,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:35:02,233 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 11 states. [2018-07-25 13:35:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:02,355 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:35:02,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:35:02,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-07-25 13:35:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:02,358 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:35:02,359 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:35:02,360 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:35:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:35:02,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-07-25 13:35:02,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:35:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:35:02,386 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-07-25 13:35:02,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:02,387 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:35:02,387 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:35:02,387 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:35:02,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:35:02,390 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:02,390 INFO L354 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2018-07-25 13:35:02,391 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:02,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1596849118, now seen corresponding path program 6 times [2018-07-25 13:35:02,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:02,509 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:02,510 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:02,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:35:02,511 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:35:02,511 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:35:02,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:35:02,512 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 12 states. [2018-07-25 13:35:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:02,668 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:35:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:35:02,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2018-07-25 13:35:02,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:02,670 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:35:02,670 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:35:02,674 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:35:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:35:02,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-07-25 13:35:02,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:35:02,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:35:02,707 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-07-25 13:35:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:02,708 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:35:02,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:35:02,708 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:35:02,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:35:02,709 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:02,710 INFO L354 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2018-07-25 13:35:02,710 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash 582280374, now seen corresponding path program 7 times [2018-07-25 13:35:02,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:02,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:02,826 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:02,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:02,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:35:02,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:35:02,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:35:02,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:35:02,828 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2018-07-25 13:35:02,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:02,989 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:35:02,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:35:02,990 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-07-25 13:35:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:02,991 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:35:02,991 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:35:02,992 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:35:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:35:03,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-07-25 13:35:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:35:03,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:35:03,018 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-07-25 13:35:03,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:03,019 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:35:03,019 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:35:03,019 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:35:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:35:03,020 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:03,021 INFO L354 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2018-07-25 13:35:03,021 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:03,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1205124958, now seen corresponding path program 8 times [2018-07-25 13:35:03,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:03,135 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:03,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:03,136 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:35:03,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:35:03,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:35:03,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=103, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:35:03,138 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 14 states. [2018-07-25 13:35:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:03,311 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:35:03,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:35:03,311 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 45 [2018-07-25 13:35:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:03,312 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:35:03,313 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:35:03,317 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=191, Invalid=315, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:35:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:35:03,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-07-25 13:35:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:35:03,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:35:03,350 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-07-25 13:35:03,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:03,350 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:35:03,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:35:03,350 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:35:03,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:35:03,352 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:03,352 INFO L354 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2018-07-25 13:35:03,353 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash -131237834, now seen corresponding path program 9 times [2018-07-25 13:35:03,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:03,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:03,482 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:03,483 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:35:03,483 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:35:03,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:35:03,486 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=118, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:35:03,486 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 15 states. [2018-07-25 13:35:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:03,669 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:35:03,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:35:03,670 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-07-25 13:35:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:03,671 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:35:03,671 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:35:03,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=226, Invalid=374, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:35:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:35:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-07-25 13:35:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:35:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:35:03,713 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-07-25 13:35:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:03,714 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:35:03,714 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:35:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:35:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:35:03,715 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:03,715 INFO L354 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2018-07-25 13:35:03,716 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:03,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1082318114, now seen corresponding path program 10 times [2018-07-25 13:35:03,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:03,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:03,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:35:03,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:35:03,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:35:03,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=134, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:35:03,848 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 16 states. [2018-07-25 13:35:04,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:04,082 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:35:04,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:35:04,083 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 55 [2018-07-25 13:35:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:04,084 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:35:04,084 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:35:04,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=264, Invalid=438, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:35:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:35:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-07-25 13:35:04,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:35:04,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:35:04,136 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-07-25 13:35:04,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:04,136 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:35:04,136 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:35:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:35:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:35:04,141 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:04,141 INFO L354 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2018-07-25 13:35:04,142 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash 480488374, now seen corresponding path program 11 times [2018-07-25 13:35:04,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:04,297 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:04,297 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:35:04,297 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:35:04,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:35:04,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=151, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:35:04,298 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 17 states. [2018-07-25 13:35:04,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:04,528 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:35:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:35:04,529 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2018-07-25 13:35:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:04,530 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:35:04,530 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:35:04,531 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:35:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:35:04,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-07-25 13:35:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:35:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:35:04,580 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-07-25 13:35:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:04,580 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:35:04,582 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:35:04,582 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:35:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:35:04,583 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:04,583 INFO L354 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2018-07-25 13:35:04,583 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:04,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1465964962, now seen corresponding path program 12 times [2018-07-25 13:35:04,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:04,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:04,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:04,737 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:35:04,737 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:35:04,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:35:04,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=169, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:35:04,738 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 18 states. [2018-07-25 13:35:05,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:05,006 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:35:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:35:05,006 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 65 [2018-07-25 13:35:05,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:05,007 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:35:05,007 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:35:05,008 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=349, Invalid=581, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:35:05,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:35:05,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-07-25 13:35:05,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:35:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:35:05,055 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-07-25 13:35:05,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:05,055 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:35:05,056 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:35:05,056 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:35:05,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:35:05,057 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:05,057 INFO L354 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2018-07-25 13:35:05,057 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:05,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1483768010, now seen corresponding path program 13 times [2018-07-25 13:35:05,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:05,198 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:05,198 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:35:05,198 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:35:05,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:35:05,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=188, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:35:05,203 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 19 states. [2018-07-25 13:35:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:05,443 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:35:05,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:35:05,443 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 70 [2018-07-25 13:35:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:05,444 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:35:05,444 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:35:05,445 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=396, Invalid=660, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:35:05,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:35:05,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-07-25 13:35:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:35:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:35:05,491 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-07-25 13:35:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:05,491 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:35:05,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:35:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:35:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:35:05,493 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:05,493 INFO L354 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2018-07-25 13:35:05,493 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash -800246238, now seen corresponding path program 14 times [2018-07-25 13:35:05,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:05,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:05,628 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:05,629 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:05,629 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:35:05,629 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:35:05,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:35:05,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=208, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:35:05,630 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 20 states. [2018-07-25 13:35:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:05,881 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:35:05,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:35:05,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 75 [2018-07-25 13:35:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:05,883 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:35:05,883 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:35:05,884 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=446, Invalid=744, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:35:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:35:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-07-25 13:35:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:35:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:35:05,937 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-07-25 13:35:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:05,938 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:35:05,938 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:35:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:35:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:35:05,944 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:05,945 INFO L354 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2018-07-25 13:35:05,945 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:05,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1167527242, now seen corresponding path program 15 times [2018-07-25 13:35:05,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:06,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:06,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:35:06,112 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:35:06,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:35:06,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=229, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:35:06,113 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 21 states. [2018-07-25 13:35:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:06,381 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:35:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:35:06,382 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 80 [2018-07-25 13:35:06,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:06,386 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:35:06,386 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:35:06,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=499, Invalid=833, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:35:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:35:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-07-25 13:35:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:35:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:35:06,442 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-07-25 13:35:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:06,442 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:35:06,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:35:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:35:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:35:06,443 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:06,443 INFO L354 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2018-07-25 13:35:06,443 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1261440350, now seen corresponding path program 16 times [2018-07-25 13:35:06,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:06,609 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:06,609 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:06,609 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:35:06,610 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:35:06,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:35:06,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=251, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:35:06,611 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 22 states. [2018-07-25 13:35:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:06,881 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:35:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:35:06,881 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 85 [2018-07-25 13:35:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:06,882 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:35:06,882 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:35:06,883 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=555, Invalid=927, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:35:06,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:35:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-07-25 13:35:06,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:35:06,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:35:06,936 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-07-25 13:35:06,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:06,936 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:35:06,937 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:35:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:35:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:35:06,937 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:06,937 INFO L354 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2018-07-25 13:35:06,938 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:06,938 INFO L82 PathProgramCache]: Analyzing trace with hash 11011638, now seen corresponding path program 17 times [2018-07-25 13:35:06,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:07,097 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:07,097 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:35:07,098 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:35:07,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:35:07,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:35:07,099 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 23 states. [2018-07-25 13:35:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:07,408 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 13:35:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:35:07,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 90 [2018-07-25 13:35:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:07,409 INFO L225 Difference]: With dead ends: 100 [2018-07-25 13:35:07,410 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:35:07,411 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=614, Invalid=1026, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:35:07,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:35:07,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-07-25 13:35:07,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:35:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:35:07,481 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-07-25 13:35:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:07,481 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:35:07,481 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:35:07,481 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:35:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:35:07,482 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:07,482 INFO L354 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2018-07-25 13:35:07,483 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:07,483 INFO L82 PathProgramCache]: Analyzing trace with hash -999223518, now seen corresponding path program 18 times [2018-07-25 13:35:07,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:07,695 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:07,695 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:35:07,696 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:35:07,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:35:07,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=298, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:35:07,697 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 24 states. [2018-07-25 13:35:08,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:08,031 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:35:08,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:35:08,032 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 95 [2018-07-25 13:35:08,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:08,033 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:35:08,033 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 13:35:08,034 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=676, Invalid=1130, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:35:08,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 13:35:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-07-25 13:35:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:35:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:35:08,102 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-07-25 13:35:08,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:08,103 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:35:08,103 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:35:08,103 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:35:08,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:35:08,104 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:08,104 INFO L354 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2018-07-25 13:35:08,104 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:08,105 INFO L82 PathProgramCache]: Analyzing trace with hash 801421750, now seen corresponding path program 19 times [2018-07-25 13:35:08,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:08,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:08,276 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:35:08,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:35:08,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:35:08,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=323, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:35:08,278 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 25 states. [2018-07-25 13:35:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:08,595 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 13:35:08,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:35:08,595 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-07-25 13:35:08,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:08,598 INFO L225 Difference]: With dead ends: 110 [2018-07-25 13:35:08,598 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:35:08,599 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=1239, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:35:08,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:35:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-07-25 13:35:08,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 13:35:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 13:35:08,665 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-07-25 13:35:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:08,665 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 13:35:08,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:35:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 13:35:08,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:35:08,667 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:08,667 INFO L354 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2018-07-25 13:35:08,667 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:08,667 INFO L82 PathProgramCache]: Analyzing trace with hash -189232222, now seen corresponding path program 20 times [2018-07-25 13:35:08,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:08,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:08,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:08,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:35:08,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:35:08,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:35:08,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=349, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:35:08,841 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 26 states. [2018-07-25 13:35:09,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:09,148 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:35:09,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:35:09,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2018-07-25 13:35:09,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:09,149 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:35:09,149 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 13:35:09,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=809, Invalid=1353, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:35:09,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 13:35:09,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-07-25 13:35:09,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:35:09,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:35:09,222 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-07-25 13:35:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:09,223 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:35:09,223 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:35:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:35:09,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:35:09,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:09,224 INFO L354 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2018-07-25 13:35:09,224 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2026435274, now seen corresponding path program 21 times [2018-07-25 13:35:09,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:09,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:09,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:35:09,408 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:35:09,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:35:09,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=376, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:35:09,410 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 27 states. [2018-07-25 13:35:09,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:09,739 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 13:35:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:35:09,740 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-07-25 13:35:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:09,741 INFO L225 Difference]: With dead ends: 120 [2018-07-25 13:35:09,741 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:35:09,742 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=880, Invalid=1472, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:35:09,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:35:09,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-07-25 13:35:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 13:35:09,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 13:35:09,823 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-07-25 13:35:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:09,824 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 13:35:09,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:35:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 13:35:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:35:09,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:09,825 INFO L354 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2018-07-25 13:35:09,825 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash -248616926, now seen corresponding path program 22 times [2018-07-25 13:35:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,029 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,029 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:35:10,029 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:35:10,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:35:10,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=404, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:35:10,031 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 28 states. [2018-07-25 13:35:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,456 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:35:10,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:35:10,457 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 115 [2018-07-25 13:35:10,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,458 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:35:10,458 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 13:35:10,460 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=954, Invalid=1596, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:35:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 13:35:10,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-07-25 13:35:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:35:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:35:10,564 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-07-25 13:35:10,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,564 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:35:10,565 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:35:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:35:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:35:10,566 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,566 INFO L354 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2018-07-25 13:35:10,567 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1349976246, now seen corresponding path program 23 times [2018-07-25 13:35:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,858 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:35:10,859 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:35:10,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:35:10,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=433, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:35:10,860 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 29 states. [2018-07-25 13:35:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,240 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 13:35:11,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:35:11,241 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 120 [2018-07-25 13:35:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,242 INFO L225 Difference]: With dead ends: 130 [2018-07-25 13:35:11,242 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:35:11,244 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1031, Invalid=1725, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:35:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:35:11,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-07-25 13:35:11,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 13:35:11,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 13:35:11,331 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-07-25 13:35:11,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,331 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 13:35:11,331 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:35:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 13:35:11,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 13:35:11,333 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,333 INFO L354 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2018-07-25 13:35:11,333 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1688558430, now seen corresponding path program 24 times [2018-07-25 13:35:11,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,557 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,557 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:35:11,558 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:35:11,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:35:11,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=463, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:35:11,559 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 30 states. [2018-07-25 13:35:11,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,972 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:35:11,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:35:11,972 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 125 [2018-07-25 13:35:11,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,973 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:35:11,974 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 13:35:11,976 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1111, Invalid=1859, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:35:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 13:35:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-07-25 13:35:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:35:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:35:12,070 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-07-25 13:35:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:12,070 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:35:12,071 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:35:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:35:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:35:12,072 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:12,072 INFO L354 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2018-07-25 13:35:12,072 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1593611318, now seen corresponding path program 25 times [2018-07-25 13:35:12,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:12,301 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:12,301 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:35:12,302 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:35:12,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:35:12,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=436, Invalid=494, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:35:12,304 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 31 states. [2018-07-25 13:35:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:12,729 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 13:35:12,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:35:12,729 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 130 [2018-07-25 13:35:12,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:12,731 INFO L225 Difference]: With dead ends: 140 [2018-07-25 13:35:12,731 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:35:12,733 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1194, Invalid=1998, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:35:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:35:12,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-07-25 13:35:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:35:12,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 13:35:12,844 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-07-25 13:35:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:12,845 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 13:35:12,845 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:35:12,845 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 13:35:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 13:35:12,847 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:12,847 INFO L354 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2018-07-25 13:35:12,847 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:12,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1966784222, now seen corresponding path program 26 times [2018-07-25 13:35:12,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:13,120 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:13,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:35:13,121 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:35:13,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:35:13,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=466, Invalid=526, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:35:13,122 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 32 states. [2018-07-25 13:35:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:13,567 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:35:13,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:35:13,567 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 135 [2018-07-25 13:35:13,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:13,568 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:35:13,568 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:35:13,570 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1280, Invalid=2142, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:35:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:35:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-07-25 13:35:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:35:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:35:13,686 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-07-25 13:35:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:13,686 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:35:13,687 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:35:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:35:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:35:13,688 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:13,689 INFO L354 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2018-07-25 13:35:13,689 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:13,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1874868298, now seen corresponding path program 27 times [2018-07-25 13:35:13,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:13,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:13,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:13,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:14,000 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:35:14,000 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:35:14,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:35:14,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=497, Invalid=559, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:35:14,002 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 33 states. [2018-07-25 13:35:14,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:14,485 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 13:35:14,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:35:14,486 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 140 [2018-07-25 13:35:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:14,487 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:35:14,487 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:35:14,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1369, Invalid=2291, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:35:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:35:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-07-25 13:35:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:35:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 13:35:14,589 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-07-25 13:35:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:14,589 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 13:35:14,589 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:35:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 13:35:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 13:35:14,591 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:14,591 INFO L354 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2018-07-25 13:35:14,591 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1930019422, now seen corresponding path program 28 times [2018-07-25 13:35:14,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:14,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:14,813 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:14,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:35:14,814 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:35:14,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:35:14,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=593, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:35:14,815 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 34 states. [2018-07-25 13:35:15,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:15,253 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:35:15,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:35:15,253 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 145 [2018-07-25 13:35:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:15,255 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:35:15,255 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 13:35:15,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1461, Invalid=2445, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:35:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 13:35:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-07-25 13:35:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:35:15,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:35:15,376 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-07-25 13:35:15,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:15,377 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:35:15,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:35:15,377 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:35:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:35:15,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:15,378 INFO L354 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2018-07-25 13:35:15,379 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1270389558, now seen corresponding path program 29 times [2018-07-25 13:35:15,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:15,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:15,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:15,619 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:15,620 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:35:15,620 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:35:15,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:35:15,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=562, Invalid=628, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:35:15,621 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 35 states. [2018-07-25 13:35:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:16,081 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 13:35:16,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:35:16,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 150 [2018-07-25 13:35:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:16,082 INFO L225 Difference]: With dead ends: 160 [2018-07-25 13:35:16,083 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:35:16,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1556, Invalid=2604, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:35:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:35:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-07-25 13:35:16,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 13:35:16,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 13:35:16,211 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-07-25 13:35:16,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:16,211 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 13:35:16,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:35:16,211 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 13:35:16,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 13:35:16,213 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:16,213 INFO L354 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2018-07-25 13:35:16,213 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash 628464162, now seen corresponding path program 30 times [2018-07-25 13:35:16,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:16,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:16,468 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:16,468 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:35:16,469 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:35:16,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:35:16,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=664, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:35:16,470 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 36 states. [2018-07-25 13:35:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:16,929 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:35:16,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:35:16,929 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 155 [2018-07-25 13:35:16,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:16,930 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:35:16,930 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 13:35:16,933 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1654, Invalid=2768, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:35:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 13:35:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-07-25 13:35:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:35:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:35:17,055 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-07-25 13:35:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:17,055 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:35:17,055 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:35:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:35:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:35:17,057 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:17,057 INFO L354 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2018-07-25 13:35:17,057 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash 48172726, now seen corresponding path program 31 times [2018-07-25 13:35:17,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:17,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:17,345 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:17,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:35:17,346 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:35:17,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:35:17,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=631, Invalid=701, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:35:17,347 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 37 states. [2018-07-25 13:35:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:17,807 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 13:35:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:35:17,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 160 [2018-07-25 13:35:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:17,809 INFO L225 Difference]: With dead ends: 170 [2018-07-25 13:35:17,809 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:35:17,811 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1755, Invalid=2937, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:35:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:35:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-07-25 13:35:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 13:35:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 13:35:17,934 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-07-25 13:35:17,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:17,935 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 13:35:17,935 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:35:17,935 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 13:35:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 13:35:17,936 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:17,937 INFO L354 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2018-07-25 13:35:17,937 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:17,937 INFO L82 PathProgramCache]: Analyzing trace with hash 231429794, now seen corresponding path program 32 times [2018-07-25 13:35:17,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,199 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,200 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:35:18,200 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:35:18,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:35:18,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=667, Invalid=739, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:35:18,201 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 38 states. [2018-07-25 13:35:18,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,704 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:35:18,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:35:18,704 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 165 [2018-07-25 13:35:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,706 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:35:18,706 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 13:35:18,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 658 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1859, Invalid=3111, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:35:18,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 13:35:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-07-25 13:35:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:35:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:35:18,856 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-07-25 13:35:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,857 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:35:18,857 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:35:18,857 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:35:18,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:35:18,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,859 INFO L354 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2018-07-25 13:35:18,859 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:18,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1322573258, now seen corresponding path program 33 times [2018-07-25 13:35:18,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:19,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:19,138 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:19,139 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:35:19,139 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:35:19,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:35:19,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=778, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:35:19,140 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 39 states. [2018-07-25 13:35:19,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:19,673 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 13:35:19,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:35:19,674 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 170 [2018-07-25 13:35:19,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:19,675 INFO L225 Difference]: With dead ends: 180 [2018-07-25 13:35:19,675 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:35:19,677 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1966, Invalid=3290, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:35:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:35:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-07-25 13:35:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 13:35:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 13:35:19,847 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-07-25 13:35:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:19,847 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 13:35:19,847 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:35:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 13:35:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 13:35:19,849 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:19,850 INFO L354 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2018-07-25 13:35:19,850 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:19,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1249938654, now seen corresponding path program 34 times [2018-07-25 13:35:19,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:20,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:20,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:35:20,228 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:35:20,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:35:20,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=818, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:35:20,230 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 40 states. [2018-07-25 13:35:20,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:20,822 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:35:20,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:35:20,822 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 175 [2018-07-25 13:35:20,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:20,824 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:35:20,824 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 13:35:20,825 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2076, Invalid=3474, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:35:20,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 13:35:20,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-07-25 13:35:20,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:35:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:35:20,999 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-07-25 13:35:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:21,000 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:35:21,000 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:35:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:35:21,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:35:21,004 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:21,004 INFO L354 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2018-07-25 13:35:21,004 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:21,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1544869302, now seen corresponding path program 35 times [2018-07-25 13:35:21,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:21,327 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:21,327 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:35:21,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:35:21,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:35:21,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=781, Invalid=859, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:35:21,329 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 41 states. [2018-07-25 13:35:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:21,858 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 13:35:21,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:35:21,858 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 180 [2018-07-25 13:35:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:21,860 INFO L225 Difference]: With dead ends: 190 [2018-07-25 13:35:21,860 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:35:21,861 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2189, Invalid=3663, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:35:21,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:35:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-07-25 13:35:22,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 13:35:22,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 13:35:22,025 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-07-25 13:35:22,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:22,026 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 13:35:22,026 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:35:22,026 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 13:35:22,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 13:35:22,028 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:22,028 INFO L354 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2018-07-25 13:35:22,029 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:22,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1038487646, now seen corresponding path program 36 times [2018-07-25 13:35:22,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:22,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:22,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:35:22,328 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:35:22,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:35:22,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=901, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:35:22,329 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 42 states. [2018-07-25 13:35:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:22,876 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:35:22,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:35:22,876 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 185 [2018-07-25 13:35:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:22,878 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:35:22,878 INFO L226 Difference]: Without dead ends: 194 [2018-07-25 13:35:22,879 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2305, Invalid=3857, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:35:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-25 13:35:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-07-25 13:35:23,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:35:23,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:35:23,036 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-07-25 13:35:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:23,037 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:35:23,037 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:35:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:35:23,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:35:23,039 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:23,039 INFO L354 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2018-07-25 13:35:23,040 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:23,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1827395274, now seen corresponding path program 37 times [2018-07-25 13:35:23,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:23,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:23,341 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:35:23,341 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:35:23,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:35:23,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=862, Invalid=944, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:35:23,342 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 43 states. [2018-07-25 13:35:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:23,964 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-25 13:35:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:35:23,964 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 190 [2018-07-25 13:35:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:23,966 INFO L225 Difference]: With dead ends: 200 [2018-07-25 13:35:23,966 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:35:23,967 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 853 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2424, Invalid=4056, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:35:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:35:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-07-25 13:35:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 13:35:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-25 13:35:24,161 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-07-25 13:35:24,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:24,161 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-25 13:35:24,161 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:35:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-25 13:35:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-25 13:35:24,163 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:24,164 INFO L354 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2018-07-25 13:35:24,164 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1893544926, now seen corresponding path program 38 times [2018-07-25 13:35:24,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:24,458 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:24,459 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:35:24,459 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:35:24,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:35:24,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=904, Invalid=988, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:35:24,460 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 44 states. [2018-07-25 13:35:24,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:24,989 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:35:24,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:35:24,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 195 [2018-07-25 13:35:24,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:24,993 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:35:24,993 INFO L226 Difference]: Without dead ends: 204 [2018-07-25 13:35:24,994 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2546, Invalid=4260, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:35:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-25 13:35:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-07-25 13:35:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:35:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:35:25,151 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-07-25 13:35:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:25,151 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:35:25,151 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:35:25,151 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:35:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:35:25,152 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:25,153 INFO L354 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2018-07-25 13:35:25,153 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash -274654026, now seen corresponding path program 39 times [2018-07-25 13:35:25,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:25,438 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:25,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:35:25,438 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:35:25,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:35:25,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=947, Invalid=1033, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:35:25,439 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 45 states. [2018-07-25 13:35:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:25,954 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-25 13:35:25,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:35:25,954 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 200 [2018-07-25 13:35:25,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:25,956 INFO L225 Difference]: With dead ends: 210 [2018-07-25 13:35:25,956 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:35:25,958 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2671, Invalid=4469, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:35:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:35:26,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-07-25 13:35:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 13:35:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-25 13:35:26,109 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-07-25 13:35:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:26,109 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-25 13:35:26,109 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:35:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-25 13:35:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-25 13:35:26,111 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:26,111 INFO L354 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2018-07-25 13:35:26,111 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1373501278, now seen corresponding path program 40 times [2018-07-25 13:35:26,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:26,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:26,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:35:26,520 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:35:26,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:35:26,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=1079, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:35:26,522 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 46 states. [2018-07-25 13:35:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:27,289 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:35:27,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:35:27,289 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 205 [2018-07-25 13:35:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:27,291 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:35:27,291 INFO L226 Difference]: Without dead ends: 214 [2018-07-25 13:35:27,293 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2799, Invalid=4683, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:35:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-07-25 13:35:27,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-07-25 13:35:27,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:35:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:35:27,450 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-07-25 13:35:27,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:27,450 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:35:27,450 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:35:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:35:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:35:27,451 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:27,451 INFO L354 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2018-07-25 13:35:27,452 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:27,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1791774666, now seen corresponding path program 41 times [2018-07-25 13:35:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:27,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:27,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:27,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:35:27,776 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:35:27,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:35:27,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1036, Invalid=1126, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:35:27,777 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 47 states. [2018-07-25 13:35:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:28,474 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-07-25 13:35:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:35:28,475 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 210 [2018-07-25 13:35:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:28,476 INFO L225 Difference]: With dead ends: 220 [2018-07-25 13:35:28,477 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:35:28,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2930, Invalid=4902, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:35:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:35:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-07-25 13:35:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-07-25 13:35:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-07-25 13:35:28,733 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-07-25 13:35:28,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:28,733 INFO L472 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-07-25 13:35:28,734 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:35:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-07-25 13:35:28,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-07-25 13:35:28,735 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:28,735 INFO L354 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2018-07-25 13:35:28,736 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:28,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1721738530, now seen corresponding path program 42 times [2018-07-25 13:35:28,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:29,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:29,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:35:29,128 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:35:29,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:35:29,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=1174, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:35:29,130 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 48 states. [2018-07-25 13:35:29,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:29,820 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 13:35:29,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:35:29,820 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 215 [2018-07-25 13:35:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:29,822 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:35:29,822 INFO L226 Difference]: Without dead ends: 224 [2018-07-25 13:35:29,824 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3064, Invalid=5126, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:35:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-07-25 13:35:30,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-07-25 13:35:30,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:35:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 13:35:30,011 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-07-25 13:35:30,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:30,011 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 13:35:30,011 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:35:30,011 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 13:35:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:35:30,012 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:30,012 INFO L354 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2018-07-25 13:35:30,012 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1320950858, now seen corresponding path program 43 times [2018-07-25 13:35:30,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:30,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:30,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:30,418 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:35:30,419 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:35:30,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:35:30,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1223, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:35:30,420 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 49 states. [2018-07-25 13:35:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:30,978 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-07-25 13:35:30,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:35:30,978 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 220 [2018-07-25 13:35:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:30,980 INFO L225 Difference]: With dead ends: 230 [2018-07-25 13:35:30,980 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:35:30,981 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3201, Invalid=5355, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:35:30,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:35:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-07-25 13:35:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-07-25 13:35:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-07-25 13:35:31,143 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-07-25 13:35:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:31,143 INFO L472 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-07-25 13:35:31,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:35:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-07-25 13:35:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-07-25 13:35:31,144 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:31,145 INFO L354 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2018-07-25 13:35:31,145 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:31,145 INFO L82 PathProgramCache]: Analyzing trace with hash 908304802, now seen corresponding path program 44 times [2018-07-25 13:35:31,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:31,508 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:31,508 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:35:31,509 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:35:31,509 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:35:31,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1177, Invalid=1273, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:35:31,510 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 50 states. [2018-07-25 13:35:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:32,072 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 13:35:32,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:35:32,072 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 225 [2018-07-25 13:35:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:32,074 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:35:32,074 INFO L226 Difference]: Without dead ends: 234 [2018-07-25 13:35:32,075 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3341, Invalid=5589, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:35:32,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-07-25 13:35:32,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-07-25 13:35:32,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:35:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 13:35:32,240 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-07-25 13:35:32,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:32,241 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 13:35:32,241 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:35:32,241 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 13:35:32,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:35:32,242 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:32,242 INFO L354 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2018-07-25 13:35:32,243 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:32,243 INFO L82 PathProgramCache]: Analyzing trace with hash -79055050, now seen corresponding path program 45 times [2018-07-25 13:35:32,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:32,649 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:32,649 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:35:32,649 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:35:32,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:35:32,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=1324, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:35:32,650 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 51 states. [2018-07-25 13:35:33,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:33,179 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-07-25 13:35:33,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:35:33,179 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 230 [2018-07-25 13:35:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:33,181 INFO L225 Difference]: With dead ends: 240 [2018-07-25 13:35:33,181 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:35:33,182 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3484, Invalid=5828, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:35:33,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:35:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-07-25 13:35:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-25 13:35:33,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-07-25 13:35:33,375 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-07-25 13:35:33,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:33,376 INFO L472 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-07-25 13:35:33,376 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:35:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-07-25 13:35:33,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-07-25 13:35:33,377 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:33,378 INFO L354 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2018-07-25 13:35:33,378 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:33,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1345715746, now seen corresponding path program 46 times [2018-07-25 13:35:33,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:33,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:33,725 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:33,726 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:35:33,726 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:35:33,726 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:35:33,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1276, Invalid=1376, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:35:33,727 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 52 states. [2018-07-25 13:35:34,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:34,305 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 13:35:34,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:35:34,305 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 235 [2018-07-25 13:35:34,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:34,307 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:35:34,307 INFO L226 Difference]: Without dead ends: 244 [2018-07-25 13:35:34,309 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1267 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3630, Invalid=6072, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:35:34,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-07-25 13:35:34,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-07-25 13:35:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:35:34,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 13:35:34,494 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-07-25 13:35:34,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:34,495 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 13:35:34,495 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:35:34,495 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 13:35:34,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:35:34,496 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:34,496 INFO L354 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2018-07-25 13:35:34,496 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:34,497 INFO L82 PathProgramCache]: Analyzing trace with hash 884812470, now seen corresponding path program 47 times [2018-07-25 13:35:34,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:34,777 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:34,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:35:34,778 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:35:34,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:35:34,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1327, Invalid=1429, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:35:34,779 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 53 states. [2018-07-25 13:35:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:35,410 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-07-25 13:35:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:35:35,411 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 240 [2018-07-25 13:35:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:35,412 INFO L225 Difference]: With dead ends: 250 [2018-07-25 13:35:35,412 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:35:35,413 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3779, Invalid=6321, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:35:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:35:35,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-07-25 13:35:35,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-07-25 13:35:35,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-07-25 13:35:35,597 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-07-25 13:35:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:35,598 INFO L472 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-07-25 13:35:35,598 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:35:35,598 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-07-25 13:35:35,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-07-25 13:35:35,599 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:35,599 INFO L354 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2018-07-25 13:35:35,600 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash 509524642, now seen corresponding path program 48 times [2018-07-25 13:35:35,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:35,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:35,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:35,877 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:35,877 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:35:35,878 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:35:35,878 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:35:35,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1379, Invalid=1483, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:35:35,879 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 54 states. [2018-07-25 13:35:36,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:36,554 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 13:35:36,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:35:36,555 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 245 [2018-07-25 13:35:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:36,556 INFO L225 Difference]: With dead ends: 255 [2018-07-25 13:35:36,556 INFO L226 Difference]: Without dead ends: 254 [2018-07-25 13:35:36,557 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1370 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3931, Invalid=6575, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:35:36,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-07-25 13:35:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-07-25 13:35:36,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:35:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 13:35:36,736 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-07-25 13:35:36,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:36,736 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 13:35:36,736 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:35:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 13:35:36,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:35:36,738 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:36,738 INFO L354 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2018-07-25 13:35:36,738 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1458160074, now seen corresponding path program 49 times [2018-07-25 13:35:36,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:37,108 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:37,108 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:35:37,108 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:35:37,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:35:37,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1432, Invalid=1538, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:35:37,110 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 55 states. [2018-07-25 13:35:37,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:37,755 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-07-25 13:35:37,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:35:37,755 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 250 [2018-07-25 13:35:37,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:37,757 INFO L225 Difference]: With dead ends: 260 [2018-07-25 13:35:37,757 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 13:35:37,759 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1423 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4086, Invalid=6834, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:35:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 13:35:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-07-25 13:35:37,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-07-25 13:35:37,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-07-25 13:35:37,990 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-07-25 13:35:37,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:37,991 INFO L472 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-07-25 13:35:37,991 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:35:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-07-25 13:35:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-07-25 13:35:37,992 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:37,993 INFO L354 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2018-07-25 13:35:37,993 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:37,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1071261918, now seen corresponding path program 50 times [2018-07-25 13:35:37,993 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:38,326 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:38,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:35:38,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:35:38,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:35:38,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1486, Invalid=1594, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:35:38,327 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 56 states. [2018-07-25 13:35:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:39,005 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-25 13:35:39,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:35:39,005 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 255 [2018-07-25 13:35:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:39,007 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:35:39,007 INFO L226 Difference]: Without dead ends: 264 [2018-07-25 13:35:39,009 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1477 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4244, Invalid=7098, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:35:39,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-07-25 13:35:39,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-07-25 13:35:39,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 13:35:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 13:35:39,236 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-07-25 13:35:39,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:39,237 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 13:35:39,237 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:35:39,237 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 13:35:39,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 13:35:39,239 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:39,239 INFO L354 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2018-07-25 13:35:39,239 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:39,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1379077706, now seen corresponding path program 51 times [2018-07-25 13:35:39,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:39,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:39,657 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:39,657 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:35:39,658 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:35:39,658 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:35:39,658 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1541, Invalid=1651, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:35:39,658 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 57 states. [2018-07-25 13:35:40,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:40,255 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-07-25 13:35:40,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:35:40,255 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 260 [2018-07-25 13:35:40,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:40,257 INFO L225 Difference]: With dead ends: 270 [2018-07-25 13:35:40,257 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:35:40,259 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4405, Invalid=7367, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:35:40,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:35:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-07-25 13:35:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-07-25 13:35:40,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-07-25 13:35:40,581 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-07-25 13:35:40,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:40,581 INFO L472 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-07-25 13:35:40,582 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:35:40,582 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-07-25 13:35:40,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-07-25 13:35:40,583 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:40,583 INFO L354 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2018-07-25 13:35:40,584 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:40,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1961667678, now seen corresponding path program 52 times [2018-07-25 13:35:40,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:41,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:41,046 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:41,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:35:41,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:35:41,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:35:41,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1597, Invalid=1709, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:35:41,047 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 58 states. [2018-07-25 13:35:41,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:41,904 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-25 13:35:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:35:41,905 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 265 [2018-07-25 13:35:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:41,906 INFO L225 Difference]: With dead ends: 275 [2018-07-25 13:35:41,906 INFO L226 Difference]: Without dead ends: 274 [2018-07-25 13:35:41,908 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1588 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4569, Invalid=7641, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:35:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-07-25 13:35:42,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-07-25 13:35:42,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 13:35:42,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-25 13:35:42,151 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2018-07-25 13:35:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:42,152 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-25 13:35:42,152 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:35:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-25 13:35:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 13:35:42,153 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:42,153 INFO L354 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2018-07-25 13:35:42,153 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:42,153 INFO L82 PathProgramCache]: Analyzing trace with hash 576275766, now seen corresponding path program 53 times [2018-07-25 13:35:42,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:42,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:42,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:35:42,502 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:35:42,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:35:42,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1654, Invalid=1768, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:35:42,503 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 59 states. [2018-07-25 13:35:43,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:43,387 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-07-25 13:35:43,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:35:43,388 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 270 [2018-07-25 13:35:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:43,389 INFO L225 Difference]: With dead ends: 280 [2018-07-25 13:35:43,390 INFO L226 Difference]: Without dead ends: 279 [2018-07-25 13:35:43,391 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1645 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4736, Invalid=7920, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:35:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-07-25 13:35:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2018-07-25 13:35:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-07-25 13:35:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-07-25 13:35:43,674 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2018-07-25 13:35:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:43,675 INFO L472 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-07-25 13:35:43,675 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:35:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-07-25 13:35:43,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-07-25 13:35:43,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:43,676 INFO L354 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2018-07-25 13:35:43,676 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:43,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1968230366, now seen corresponding path program 54 times [2018-07-25 13:35:43,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:43,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:44,014 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:44,014 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:35:44,014 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:35:44,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:35:44,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1712, Invalid=1828, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:35:44,015 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 60 states. [2018-07-25 13:35:44,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:44,625 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-07-25 13:35:44,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:35:44,625 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 275 [2018-07-25 13:35:44,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:44,627 INFO L225 Difference]: With dead ends: 285 [2018-07-25 13:35:44,627 INFO L226 Difference]: Without dead ends: 284 [2018-07-25 13:35:44,628 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4906, Invalid=8204, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:35:44,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-07-25 13:35:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2018-07-25 13:35:44,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-07-25 13:35:44,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-07-25 13:35:44,847 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2018-07-25 13:35:44,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:44,847 INFO L472 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-07-25 13:35:44,847 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:35:44,848 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-07-25 13:35:44,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-07-25 13:35:44,848 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:44,849 INFO L354 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2018-07-25 13:35:44,849 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:44,849 INFO L82 PathProgramCache]: Analyzing trace with hash -265078602, now seen corresponding path program 55 times [2018-07-25 13:35:44,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:45,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:45,208 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:45,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:35:45,209 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:35:45,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:35:45,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1771, Invalid=1889, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:35:45,210 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 61 states. [2018-07-25 13:35:45,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:45,897 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-07-25 13:35:45,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:35:45,897 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 280 [2018-07-25 13:35:45,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:45,898 INFO L225 Difference]: With dead ends: 290 [2018-07-25 13:35:45,898 INFO L226 Difference]: Without dead ends: 289 [2018-07-25 13:35:45,900 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1762 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5079, Invalid=8493, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:35:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-07-25 13:35:46,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2018-07-25 13:35:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-07-25 13:35:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-07-25 13:35:46,173 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2018-07-25 13:35:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:46,173 INFO L472 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-07-25 13:35:46,173 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:35:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-07-25 13:35:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-07-25 13:35:46,202 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:46,202 INFO L354 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2018-07-25 13:35:46,202 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:46,206 INFO L82 PathProgramCache]: Analyzing trace with hash 8481954, now seen corresponding path program 56 times [2018-07-25 13:35:46,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:46,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:46,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:35:46,559 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:35:46,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:35:46,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1831, Invalid=1951, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:35:46,560 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 62 states. [2018-07-25 13:35:47,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:47,211 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-07-25 13:35:47,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:35:47,211 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 285 [2018-07-25 13:35:47,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:47,213 INFO L225 Difference]: With dead ends: 295 [2018-07-25 13:35:47,213 INFO L226 Difference]: Without dead ends: 294 [2018-07-25 13:35:47,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1822 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5255, Invalid=8787, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:35:47,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-07-25 13:35:47,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2018-07-25 13:35:47,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-07-25 13:35:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-07-25 13:35:47,451 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2018-07-25 13:35:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:47,451 INFO L472 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-07-25 13:35:47,452 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:35:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-07-25 13:35:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-07-25 13:35:47,453 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:47,453 INFO L354 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2018-07-25 13:35:47,453 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1965896650, now seen corresponding path program 57 times [2018-07-25 13:35:47,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:47,864 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:47,864 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:35:47,864 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:35:47,865 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:35:47,865 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1892, Invalid=2014, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:35:47,865 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 63 states. [2018-07-25 13:35:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:48,556 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-07-25 13:35:48,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:35:48,556 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 290 [2018-07-25 13:35:48,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:48,557 INFO L225 Difference]: With dead ends: 300 [2018-07-25 13:35:48,558 INFO L226 Difference]: Without dead ends: 299 [2018-07-25 13:35:48,559 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5434, Invalid=9086, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:35:48,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-07-25 13:35:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-07-25 13:35:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-07-25 13:35:48,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-07-25 13:35:48,978 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2018-07-25 13:35:48,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:48,978 INFO L472 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-07-25 13:35:48,978 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:35:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-07-25 13:35:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-07-25 13:35:48,980 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:48,980 INFO L354 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2018-07-25 13:35:48,981 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:48,981 INFO L82 PathProgramCache]: Analyzing trace with hash -468580062, now seen corresponding path program 58 times [2018-07-25 13:35:48,981 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:49,453 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:49,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:35:49,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:35:49,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:35:49,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1954, Invalid=2078, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:35:49,455 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 64 states. [2018-07-25 13:35:50,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:50,126 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-07-25 13:35:50,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:35:50,127 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 295 [2018-07-25 13:35:50,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:50,128 INFO L225 Difference]: With dead ends: 305 [2018-07-25 13:35:50,128 INFO L226 Difference]: Without dead ends: 304 [2018-07-25 13:35:50,130 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1945 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5616, Invalid=9390, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:35:50,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-07-25 13:35:50,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-07-25 13:35:50,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-07-25 13:35:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-07-25 13:35:50,409 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2018-07-25 13:35:50,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:50,409 INFO L472 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-07-25 13:35:50,410 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:35:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-07-25 13:35:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-07-25 13:35:50,411 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:50,412 INFO L354 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2018-07-25 13:35:50,412 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:50,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1873805238, now seen corresponding path program 59 times [2018-07-25 13:35:50,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:50,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:50,814 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:50,814 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:50,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:35:50,815 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:35:50,815 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:35:50,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2017, Invalid=2143, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:35:50,816 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 65 states. [2018-07-25 13:35:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:51,548 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-07-25 13:35:51,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:35:51,548 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 300 [2018-07-25 13:35:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:51,549 INFO L225 Difference]: With dead ends: 310 [2018-07-25 13:35:51,550 INFO L226 Difference]: Without dead ends: 309 [2018-07-25 13:35:51,551 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2008 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5801, Invalid=9699, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:35:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-07-25 13:35:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2018-07-25 13:35:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-07-25 13:35:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-07-25 13:35:51,799 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2018-07-25 13:35:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:51,799 INFO L472 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-07-25 13:35:51,799 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:35:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-07-25 13:35:51,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-07-25 13:35:51,801 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:51,801 INFO L354 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2018-07-25 13:35:51,802 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:51,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1659438498, now seen corresponding path program 60 times [2018-07-25 13:35:51,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:52,342 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:52,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:35:52,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:35:52,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:35:52,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2081, Invalid=2209, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:35:52,344 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 66 states. [2018-07-25 13:35:53,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:53,184 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-07-25 13:35:53,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:35:53,184 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 305 [2018-07-25 13:35:53,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:53,186 INFO L225 Difference]: With dead ends: 315 [2018-07-25 13:35:53,186 INFO L226 Difference]: Without dead ends: 314 [2018-07-25 13:35:53,187 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5989, Invalid=10013, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:35:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-07-25 13:35:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2018-07-25 13:35:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-07-25 13:35:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-07-25 13:35:53,456 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2018-07-25 13:35:53,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:53,456 INFO L472 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-07-25 13:35:53,456 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:35:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-07-25 13:35:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-07-25 13:35:53,458 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:53,458 INFO L354 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2018-07-25 13:35:53,459 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:53,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1505569994, now seen corresponding path program 61 times [2018-07-25 13:35:53,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:53,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:53,857 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:53,858 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:35:53,858 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:35:53,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:35:53,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2146, Invalid=2276, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:35:53,860 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 67 states. [2018-07-25 13:35:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:54,721 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-07-25 13:35:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:35:54,722 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 310 [2018-07-25 13:35:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:54,723 INFO L225 Difference]: With dead ends: 320 [2018-07-25 13:35:54,723 INFO L226 Difference]: Without dead ends: 319 [2018-07-25 13:35:54,724 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6180, Invalid=10332, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:35:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-07-25 13:35:55,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2018-07-25 13:35:55,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-07-25 13:35:55,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-07-25 13:35:55,007 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2018-07-25 13:35:55,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:55,008 INFO L472 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-07-25 13:35:55,008 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:35:55,008 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-07-25 13:35:55,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-07-25 13:35:55,009 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:55,010 INFO L354 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2018-07-25 13:35:55,010 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1619943970, now seen corresponding path program 62 times [2018-07-25 13:35:55,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:55,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:55,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:35:55,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:35:55,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:35:55,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=2344, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:35:55,671 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 68 states. [2018-07-25 13:35:56,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:56,610 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-07-25 13:35:56,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:35:56,610 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 315 [2018-07-25 13:35:56,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:56,611 INFO L225 Difference]: With dead ends: 325 [2018-07-25 13:35:56,612 INFO L226 Difference]: Without dead ends: 324 [2018-07-25 13:35:56,613 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2203 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=6374, Invalid=10656, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:35:56,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-07-25 13:35:56,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2018-07-25 13:35:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-07-25 13:35:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-07-25 13:35:56,895 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2018-07-25 13:35:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:56,895 INFO L472 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-07-25 13:35:56,895 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:35:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-07-25 13:35:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-07-25 13:35:56,897 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:56,897 INFO L354 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2018-07-25 13:35:56,898 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:56,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1073956534, now seen corresponding path program 63 times [2018-07-25 13:35:56,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:57,313 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:57,313 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:35:57,314 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:35:57,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:35:57,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2279, Invalid=2413, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:35:57,315 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 69 states. [2018-07-25 13:35:58,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:58,147 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-07-25 13:35:58,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:35:58,147 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 320 [2018-07-25 13:35:58,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:58,149 INFO L225 Difference]: With dead ends: 330 [2018-07-25 13:35:58,149 INFO L226 Difference]: Without dead ends: 329 [2018-07-25 13:35:58,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6571, Invalid=10985, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:35:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-07-25 13:35:58,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2018-07-25 13:35:58,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-07-25 13:35:58,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-07-25 13:35:58,441 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2018-07-25 13:35:58,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:58,441 INFO L472 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-07-25 13:35:58,441 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:35:58,441 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-07-25 13:35:58,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-07-25 13:35:58,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:58,443 INFO L354 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2018-07-25 13:35:58,443 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:35:58,443 INFO L82 PathProgramCache]: Analyzing trace with hash -158720350, now seen corresponding path program 64 times [2018-07-25 13:35:58,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:58,904 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:58,904 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:35:58,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:35:58,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:35:58,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2347, Invalid=2483, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:35:58,906 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 70 states. [2018-07-25 13:35:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:59,783 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-07-25 13:35:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:35:59,783 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 325 [2018-07-25 13:35:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:59,785 INFO L225 Difference]: With dead ends: 335 [2018-07-25 13:35:59,785 INFO L226 Difference]: Without dead ends: 334 [2018-07-25 13:35:59,787 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2338 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6771, Invalid=11319, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:35:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-07-25 13:36:00,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2018-07-25 13:36:00,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-07-25 13:36:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-07-25 13:36:00,166 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2018-07-25 13:36:00,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:00,166 INFO L472 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-07-25 13:36:00,166 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:36:00,166 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-07-25 13:36:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-07-25 13:36:00,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:00,168 INFO L354 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2018-07-25 13:36:00,169 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:00,169 INFO L82 PathProgramCache]: Analyzing trace with hash -664184266, now seen corresponding path program 65 times [2018-07-25 13:36:00,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:00,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:00,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:00,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:36:00,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:36:00,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:36:00,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2416, Invalid=2554, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:36:00,647 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 71 states. [2018-07-25 13:36:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:01,491 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-07-25 13:36:01,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:36:01,491 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 330 [2018-07-25 13:36:01,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:01,492 INFO L225 Difference]: With dead ends: 340 [2018-07-25 13:36:01,492 INFO L226 Difference]: Without dead ends: 339 [2018-07-25 13:36:01,494 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2407 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6974, Invalid=11658, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:36:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-07-25 13:36:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2018-07-25 13:36:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-07-25 13:36:01,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-07-25 13:36:01,820 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2018-07-25 13:36:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:01,820 INFO L472 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-07-25 13:36:01,820 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:36:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-07-25 13:36:01,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-07-25 13:36:01,822 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:01,822 INFO L354 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2018-07-25 13:36:01,822 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:01,822 INFO L82 PathProgramCache]: Analyzing trace with hash -194757854, now seen corresponding path program 66 times [2018-07-25 13:36:01,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:02,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:02,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:36:02,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:36:02,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:36:02,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2486, Invalid=2626, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:36:02,325 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 72 states. [2018-07-25 13:36:03,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:03,215 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-07-25 13:36:03,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:36:03,216 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 335 [2018-07-25 13:36:03,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:03,217 INFO L225 Difference]: With dead ends: 345 [2018-07-25 13:36:03,217 INFO L226 Difference]: Without dead ends: 344 [2018-07-25 13:36:03,219 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7180, Invalid=12002, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:36:03,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-07-25 13:36:03,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2018-07-25 13:36:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-07-25 13:36:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-07-25 13:36:03,532 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2018-07-25 13:36:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:03,533 INFO L472 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-07-25 13:36:03,533 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:36:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-07-25 13:36:03,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-07-25 13:36:03,534 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:03,534 INFO L354 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2018-07-25 13:36:03,534 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:03,535 INFO L82 PathProgramCache]: Analyzing trace with hash 351079862, now seen corresponding path program 67 times [2018-07-25 13:36:03,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:04,046 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:04,046 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:36:04,046 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:36:04,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:36:04,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2557, Invalid=2699, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:36:04,047 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 73 states. [2018-07-25 13:36:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:04,936 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-07-25 13:36:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:36:04,936 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 340 [2018-07-25 13:36:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:04,938 INFO L225 Difference]: With dead ends: 350 [2018-07-25 13:36:04,938 INFO L226 Difference]: Without dead ends: 349 [2018-07-25 13:36:04,940 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2548 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7389, Invalid=12351, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:36:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-07-25 13:36:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2018-07-25 13:36:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-07-25 13:36:05,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-07-25 13:36:05,258 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2018-07-25 13:36:05,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:05,258 INFO L472 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-07-25 13:36:05,258 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:36:05,258 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-07-25 13:36:05,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-07-25 13:36:05,259 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:05,259 INFO L354 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2018-07-25 13:36:05,260 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:05,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1604630434, now seen corresponding path program 68 times [2018-07-25 13:36:05,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:05,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:05,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:36:05,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:36:05,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:36:05,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2629, Invalid=2773, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:36:05,790 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 74 states. [2018-07-25 13:36:06,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:06,717 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-07-25 13:36:06,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:36:06,718 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 345 [2018-07-25 13:36:06,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:06,719 INFO L225 Difference]: With dead ends: 355 [2018-07-25 13:36:06,719 INFO L226 Difference]: Without dead ends: 354 [2018-07-25 13:36:06,720 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2620 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7601, Invalid=12705, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:36:06,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-07-25 13:36:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2018-07-25 13:36:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-07-25 13:36:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-07-25 13:36:07,064 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2018-07-25 13:36:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:07,065 INFO L472 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-07-25 13:36:07,065 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:36:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-07-25 13:36:07,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-07-25 13:36:07,067 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:07,067 INFO L354 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2018-07-25 13:36:07,068 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash 621175094, now seen corresponding path program 69 times [2018-07-25 13:36:07,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:07,735 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:07,735 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:07,735 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:36:07,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:36:07,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:36:07,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2702, Invalid=2848, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:36:07,737 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 75 states. [2018-07-25 13:36:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:08,705 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-07-25 13:36:08,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:36:08,705 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 350 [2018-07-25 13:36:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:08,707 INFO L225 Difference]: With dead ends: 360 [2018-07-25 13:36:08,707 INFO L226 Difference]: Without dead ends: 359 [2018-07-25 13:36:08,708 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2693 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7816, Invalid=13064, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:36:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-07-25 13:36:09,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2018-07-25 13:36:09,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-07-25 13:36:09,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-07-25 13:36:09,041 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2018-07-25 13:36:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:09,041 INFO L472 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-07-25 13:36:09,042 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:36:09,042 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-07-25 13:36:09,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-07-25 13:36:09,043 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:09,043 INFO L354 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2018-07-25 13:36:09,043 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:09,043 INFO L82 PathProgramCache]: Analyzing trace with hash -204237790, now seen corresponding path program 70 times [2018-07-25 13:36:09,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:09,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:09,590 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:09,590 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:09,591 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:36:09,591 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:36:09,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:36:09,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2776, Invalid=2924, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:36:09,592 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 76 states. [2018-07-25 13:36:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:10,579 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-07-25 13:36:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:36:10,579 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 355 [2018-07-25 13:36:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:10,581 INFO L225 Difference]: With dead ends: 365 [2018-07-25 13:36:10,581 INFO L226 Difference]: Without dead ends: 364 [2018-07-25 13:36:10,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8034, Invalid=13428, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:36:10,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-07-25 13:36:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-07-25 13:36:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-07-25 13:36:10,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-07-25 13:36:10,929 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2018-07-25 13:36:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:10,929 INFO L472 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-07-25 13:36:10,929 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:36:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-07-25 13:36:10,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-07-25 13:36:10,930 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:10,930 INFO L354 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2018-07-25 13:36:10,930 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:10,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1110267062, now seen corresponding path program 71 times [2018-07-25 13:36:10,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:10,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:11,479 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:11,480 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:11,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:36:11,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:36:11,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:36:11,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2851, Invalid=3001, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:36:11,481 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 77 states. [2018-07-25 13:36:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:12,482 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-07-25 13:36:12,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:36:12,483 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 360 [2018-07-25 13:36:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:12,484 INFO L225 Difference]: With dead ends: 370 [2018-07-25 13:36:12,484 INFO L226 Difference]: Without dead ends: 369 [2018-07-25 13:36:12,486 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2842 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8255, Invalid=13797, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:36:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-07-25 13:36:12,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2018-07-25 13:36:12,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-07-25 13:36:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-07-25 13:36:12,859 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2018-07-25 13:36:12,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:12,859 INFO L472 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-07-25 13:36:12,859 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:36:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-07-25 13:36:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-07-25 13:36:12,861 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:12,861 INFO L354 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2018-07-25 13:36:12,862 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:12,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1569140574, now seen corresponding path program 72 times [2018-07-25 13:36:12,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:13,430 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:13,430 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:36:13,430 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:36:13,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:36:13,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2927, Invalid=3079, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:36:13,431 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 78 states. [2018-07-25 13:36:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:14,493 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-07-25 13:36:14,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:36:14,493 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 365 [2018-07-25 13:36:14,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:14,494 INFO L225 Difference]: With dead ends: 375 [2018-07-25 13:36:14,495 INFO L226 Difference]: Without dead ends: 374 [2018-07-25 13:36:14,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2918 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=8479, Invalid=14171, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:36:14,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-07-25 13:36:14,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2018-07-25 13:36:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-07-25 13:36:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-07-25 13:36:14,919 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2018-07-25 13:36:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:14,919 INFO L472 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-07-25 13:36:14,919 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:36:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-07-25 13:36:14,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-07-25 13:36:14,921 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:14,921 INFO L354 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2018-07-25 13:36:14,921 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:14,921 INFO L82 PathProgramCache]: Analyzing trace with hash 802809910, now seen corresponding path program 73 times [2018-07-25 13:36:14,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:15,498 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:15,498 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:15,499 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:36:15,499 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:36:15,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:36:15,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3004, Invalid=3158, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:36:15,500 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 79 states. [2018-07-25 13:36:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:16,513 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-07-25 13:36:16,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:36:16,513 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 370 [2018-07-25 13:36:16,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:16,515 INFO L225 Difference]: With dead ends: 380 [2018-07-25 13:36:16,515 INFO L226 Difference]: Without dead ends: 379 [2018-07-25 13:36:16,516 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2995 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8706, Invalid=14550, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:36:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-07-25 13:36:16,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2018-07-25 13:36:16,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-07-25 13:36:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-07-25 13:36:16,896 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2018-07-25 13:36:16,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:16,896 INFO L472 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-07-25 13:36:16,897 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:36:16,897 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-07-25 13:36:16,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-07-25 13:36:16,898 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:16,898 INFO L354 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2018-07-25 13:36:16,898 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:16,898 INFO L82 PathProgramCache]: Analyzing trace with hash 320630050, now seen corresponding path program 74 times [2018-07-25 13:36:16,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:17,457 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:17,457 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:36:17,457 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:36:17,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:36:17,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=3238, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:36:17,458 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 80 states. [2018-07-25 13:36:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:18,590 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-07-25 13:36:18,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:36:18,590 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 375 [2018-07-25 13:36:18,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:18,591 INFO L225 Difference]: With dead ends: 385 [2018-07-25 13:36:18,591 INFO L226 Difference]: Without dead ends: 384 [2018-07-25 13:36:18,593 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3073 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=8936, Invalid=14934, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:36:18,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-07-25 13:36:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2018-07-25 13:36:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-07-25 13:36:19,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-07-25 13:36:19,009 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2018-07-25 13:36:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:19,009 INFO L472 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-07-25 13:36:19,009 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:36:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-07-25 13:36:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-07-25 13:36:19,011 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:19,011 INFO L354 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2018-07-25 13:36:19,011 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1148970058, now seen corresponding path program 75 times [2018-07-25 13:36:19,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:19,586 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:19,586 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:19,586 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:36:19,587 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:36:19,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:36:19,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3161, Invalid=3319, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:36:19,588 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 81 states. [2018-07-25 13:36:20,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:20,669 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2018-07-25 13:36:20,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:36:20,669 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 380 [2018-07-25 13:36:20,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:20,671 INFO L225 Difference]: With dead ends: 390 [2018-07-25 13:36:20,671 INFO L226 Difference]: Without dead ends: 389 [2018-07-25 13:36:20,673 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9169, Invalid=15323, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:36:20,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-07-25 13:36:21,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2018-07-25 13:36:21,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-07-25 13:36:21,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-07-25 13:36:21,076 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2018-07-25 13:36:21,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:21,076 INFO L472 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-07-25 13:36:21,076 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:36:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-07-25 13:36:21,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-07-25 13:36:21,078 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:21,078 INFO L354 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2018-07-25 13:36:21,078 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash 591817122, now seen corresponding path program 76 times [2018-07-25 13:36:21,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:21,665 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:21,666 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:21,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:36:21,666 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:36:21,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:36:21,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3241, Invalid=3401, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:36:21,667 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 82 states. [2018-07-25 13:36:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:22,780 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-07-25 13:36:22,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:36:22,780 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 385 [2018-07-25 13:36:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:22,782 INFO L225 Difference]: With dead ends: 395 [2018-07-25 13:36:22,782 INFO L226 Difference]: Without dead ends: 394 [2018-07-25 13:36:22,783 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9405, Invalid=15717, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:36:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-07-25 13:36:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2018-07-25 13:36:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2018-07-25 13:36:23,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2018-07-25 13:36:23,204 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2018-07-25 13:36:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:23,205 INFO L472 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2018-07-25 13:36:23,205 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:36:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2018-07-25 13:36:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2018-07-25 13:36:23,206 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:23,206 INFO L354 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2018-07-25 13:36:23,206 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1017376566, now seen corresponding path program 77 times [2018-07-25 13:36:23,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:23,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:23,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:23,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:36:23,812 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:36:23,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:36:23,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3322, Invalid=3484, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:36:23,813 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 83 states. [2018-07-25 13:36:25,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:25,007 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-07-25 13:36:25,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:36:25,007 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 390 [2018-07-25 13:36:25,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:25,009 INFO L225 Difference]: With dead ends: 400 [2018-07-25 13:36:25,009 INFO L226 Difference]: Without dead ends: 399 [2018-07-25 13:36:25,011 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3313 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9644, Invalid=16116, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:36:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-07-25 13:36:25,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2018-07-25 13:36:25,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-07-25 13:36:25,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-07-25 13:36:25,446 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2018-07-25 13:36:25,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:25,447 INFO L472 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-07-25 13:36:25,447 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:36:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-07-25 13:36:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-07-25 13:36:25,448 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:25,448 INFO L354 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2018-07-25 13:36:25,448 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:25,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1719584290, now seen corresponding path program 78 times [2018-07-25 13:36:25,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:26,092 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:26,093 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:26,093 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:36:26,093 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:36:26,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:36:26,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3404, Invalid=3568, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:36:26,094 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 84 states. [2018-07-25 13:36:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:27,260 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-07-25 13:36:27,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:36:27,260 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 395 [2018-07-25 13:36:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:27,262 INFO L225 Difference]: With dead ends: 405 [2018-07-25 13:36:27,262 INFO L226 Difference]: Without dead ends: 404 [2018-07-25 13:36:27,264 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3395 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9886, Invalid=16520, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:36:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-07-25 13:36:27,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2018-07-25 13:36:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-07-25 13:36:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2018-07-25 13:36:27,702 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2018-07-25 13:36:27,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:27,702 INFO L472 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2018-07-25 13:36:27,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:36:27,703 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2018-07-25 13:36:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-07-25 13:36:27,704 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:27,704 INFO L354 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2018-07-25 13:36:27,704 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:27,704 INFO L82 PathProgramCache]: Analyzing trace with hash 347169462, now seen corresponding path program 79 times [2018-07-25 13:36:27,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:28,584 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:28,584 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:36:28,584 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:36:28,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:36:28,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3487, Invalid=3653, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:36:28,585 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 85 states. [2018-07-25 13:36:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:29,859 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-07-25 13:36:29,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:36:29,859 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 400 [2018-07-25 13:36:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:29,860 INFO L225 Difference]: With dead ends: 410 [2018-07-25 13:36:29,861 INFO L226 Difference]: Without dead ends: 409 [2018-07-25 13:36:29,862 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3478 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=10131, Invalid=16929, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:36:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-07-25 13:36:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2018-07-25 13:36:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-07-25 13:36:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-07-25 13:36:30,313 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2018-07-25 13:36:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:30,313 INFO L472 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-07-25 13:36:30,313 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:36:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-07-25 13:36:30,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-07-25 13:36:30,314 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:30,315 INFO L354 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2018-07-25 13:36:30,315 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:30,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1504869726, now seen corresponding path program 80 times [2018-07-25 13:36:30,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:30,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:30,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:36:30,958 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:36:30,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:36:30,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3571, Invalid=3739, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:36:30,959 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 86 states. [2018-07-25 13:36:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:32,196 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-07-25 13:36:32,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:36:32,197 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 405 [2018-07-25 13:36:32,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:32,199 INFO L225 Difference]: With dead ends: 415 [2018-07-25 13:36:32,199 INFO L226 Difference]: Without dead ends: 414 [2018-07-25 13:36:32,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3562 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10379, Invalid=17343, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:36:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-07-25 13:36:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2018-07-25 13:36:32,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-07-25 13:36:32,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-07-25 13:36:32,685 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2018-07-25 13:36:32,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:32,685 INFO L472 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-07-25 13:36:32,685 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:36:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-07-25 13:36:32,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-07-25 13:36:32,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:32,687 INFO L354 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2018-07-25 13:36:32,687 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 790918710, now seen corresponding path program 81 times [2018-07-25 13:36:32,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:33,403 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:33,403 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:36:33,403 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:36:33,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:36:33,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3656, Invalid=3826, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:36:33,404 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 87 states. [2018-07-25 13:36:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:34,635 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2018-07-25 13:36:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:36:34,635 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 410 [2018-07-25 13:36:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:34,637 INFO L225 Difference]: With dead ends: 420 [2018-07-25 13:36:34,637 INFO L226 Difference]: Without dead ends: 419 [2018-07-25 13:36:34,639 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3647 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10630, Invalid=17762, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:36:34,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-07-25 13:36:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2018-07-25 13:36:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-07-25 13:36:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-07-25 13:36:35,120 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2018-07-25 13:36:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:35,120 INFO L472 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-07-25 13:36:35,120 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:36:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-07-25 13:36:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-07-25 13:36:35,122 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:35,122 INFO L354 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2018-07-25 13:36:35,122 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1648008994, now seen corresponding path program 82 times [2018-07-25 13:36:35,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:35,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:35,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:36:35,809 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:36:35,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:36:35,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3742, Invalid=3914, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:36:35,811 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 88 states. [2018-07-25 13:36:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:37,124 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-07-25 13:36:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:36:37,124 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 415 [2018-07-25 13:36:37,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:37,125 INFO L225 Difference]: With dead ends: 425 [2018-07-25 13:36:37,125 INFO L226 Difference]: Without dead ends: 424 [2018-07-25 13:36:37,127 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3733 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=10884, Invalid=18186, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:36:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-07-25 13:36:37,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2018-07-25 13:36:37,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-07-25 13:36:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2018-07-25 13:36:37,614 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2018-07-25 13:36:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:37,615 INFO L472 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2018-07-25 13:36:37,615 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:36:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2018-07-25 13:36:37,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2018-07-25 13:36:37,616 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:37,617 INFO L354 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2018-07-25 13:36:37,617 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash -2123028042, now seen corresponding path program 83 times [2018-07-25 13:36:37,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:38,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:38,289 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:36:38,289 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:36:38,290 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:36:38,290 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3829, Invalid=4003, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:36:38,291 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 89 states. [2018-07-25 13:36:39,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:39,635 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2018-07-25 13:36:39,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:36:39,635 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 420 [2018-07-25 13:36:39,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:39,637 INFO L225 Difference]: With dead ends: 430 [2018-07-25 13:36:39,637 INFO L226 Difference]: Without dead ends: 429 [2018-07-25 13:36:39,639 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3820 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11141, Invalid=18615, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:36:39,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-07-25 13:36:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2018-07-25 13:36:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-07-25 13:36:40,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2018-07-25 13:36:40,153 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2018-07-25 13:36:40,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:40,153 INFO L472 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2018-07-25 13:36:40,153 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:36:40,153 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2018-07-25 13:36:40,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-07-25 13:36:40,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:40,155 INFO L354 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2018-07-25 13:36:40,155 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:40,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1338907554, now seen corresponding path program 84 times [2018-07-25 13:36:40,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:40,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:40,909 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:40,909 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:36:40,909 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:36:40,910 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:36:40,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3917, Invalid=4093, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:36:40,911 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 90 states. [2018-07-25 13:36:42,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:42,262 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-07-25 13:36:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:36:42,263 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 425 [2018-07-25 13:36:42,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:42,264 INFO L225 Difference]: With dead ends: 435 [2018-07-25 13:36:42,264 INFO L226 Difference]: Without dead ends: 434 [2018-07-25 13:36:42,266 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3908 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=11401, Invalid=19049, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:36:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-07-25 13:36:42,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2018-07-25 13:36:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-07-25 13:36:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-07-25 13:36:42,786 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2018-07-25 13:36:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:42,786 INFO L472 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-07-25 13:36:42,786 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:36:42,786 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-07-25 13:36:42,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-07-25 13:36:42,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:42,788 INFO L354 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2018-07-25 13:36:42,788 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:42,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1961132746, now seen corresponding path program 85 times [2018-07-25 13:36:42,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:43,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:43,775 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:43,775 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:36:43,776 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:36:43,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:36:43,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4006, Invalid=4184, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:36:43,777 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 91 states. [2018-07-25 13:36:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:45,161 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2018-07-25 13:36:45,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:36:45,161 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 430 [2018-07-25 13:36:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:45,162 INFO L225 Difference]: With dead ends: 440 [2018-07-25 13:36:45,162 INFO L226 Difference]: Without dead ends: 439 [2018-07-25 13:36:45,165 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3997 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=11664, Invalid=19488, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:36:45,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-07-25 13:36:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 436. [2018-07-25 13:36:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-07-25 13:36:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-07-25 13:36:45,697 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 430 [2018-07-25 13:36:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:45,697 INFO L472 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-07-25 13:36:45,697 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:36:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-07-25 13:36:45,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-07-25 13:36:45,699 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:45,699 INFO L354 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1] [2018-07-25 13:36:45,699 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:45,700 INFO L82 PathProgramCache]: Analyzing trace with hash -628099038, now seen corresponding path program 86 times [2018-07-25 13:36:45,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 18619 backedges. 0 proven. 18619 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:46,434 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:46,434 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:36:46,434 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:36:46,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:36:46,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4096, Invalid=4276, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:36:46,435 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 92 states. [2018-07-25 13:36:47,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:47,879 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-07-25 13:36:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:36:47,879 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 435 [2018-07-25 13:36:47,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:47,881 INFO L225 Difference]: With dead ends: 445 [2018-07-25 13:36:47,881 INFO L226 Difference]: Without dead ends: 444 [2018-07-25 13:36:47,882 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4087 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=11930, Invalid=19932, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:36:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-07-25 13:36:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2018-07-25 13:36:48,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-07-25 13:36:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 441 transitions. [2018-07-25 13:36:48,423 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 441 transitions. Word has length 435 [2018-07-25 13:36:48,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:48,423 INFO L472 AbstractCegarLoop]: Abstraction has 441 states and 441 transitions. [2018-07-25 13:36:48,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:36:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 441 transitions. [2018-07-25 13:36:48,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-07-25 13:36:48,425 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:48,425 INFO L354 BasicCegarLoop]: trace histogram [88, 88, 88, 87, 87, 1, 1] [2018-07-25 13:36:48,425 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:48,425 INFO L82 PathProgramCache]: Analyzing trace with hash -712019786, now seen corresponding path program 87 times [2018-07-25 13:36:48,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:49,182 INFO L134 CoverageAnalysis]: Checked inductivity of 19053 backedges. 0 proven. 19053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:49,182 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:49,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:36:49,183 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:36:49,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:36:49,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4187, Invalid=4369, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:36:49,184 INFO L87 Difference]: Start difference. First operand 441 states and 441 transitions. Second operand 93 states. [2018-07-25 13:36:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:50,642 INFO L93 Difference]: Finished difference Result 450 states and 450 transitions. [2018-07-25 13:36:50,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:36:50,643 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 440 [2018-07-25 13:36:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:50,644 INFO L225 Difference]: With dead ends: 450 [2018-07-25 13:36:50,644 INFO L226 Difference]: Without dead ends: 449 [2018-07-25 13:36:50,647 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=12199, Invalid=20381, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:36:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-07-25 13:36:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2018-07-25 13:36:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-07-25 13:36:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 446 transitions. [2018-07-25 13:36:51,207 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 446 transitions. Word has length 440 [2018-07-25 13:36:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:51,208 INFO L472 AbstractCegarLoop]: Abstraction has 446 states and 446 transitions. [2018-07-25 13:36:51,208 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:36:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 446 transitions. [2018-07-25 13:36:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-07-25 13:36:51,209 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:51,209 INFO L354 BasicCegarLoop]: trace histogram [89, 89, 89, 88, 88, 1, 1] [2018-07-25 13:36:51,210 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:51,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1542966110, now seen corresponding path program 88 times [2018-07-25 13:36:51,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:52,009 INFO L134 CoverageAnalysis]: Checked inductivity of 19492 backedges. 0 proven. 19492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:52,009 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:52,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:36:52,010 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:36:52,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:36:52,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4279, Invalid=4463, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:36:52,011 INFO L87 Difference]: Start difference. First operand 446 states and 446 transitions. Second operand 94 states. [2018-07-25 13:36:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:53,505 INFO L93 Difference]: Finished difference Result 455 states and 455 transitions. [2018-07-25 13:36:53,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:36:53,505 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 445 [2018-07-25 13:36:53,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:53,507 INFO L225 Difference]: With dead ends: 455 [2018-07-25 13:36:53,507 INFO L226 Difference]: Without dead ends: 454 [2018-07-25 13:36:53,510 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4270 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=12471, Invalid=20835, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:36:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2018-07-25 13:36:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2018-07-25 13:36:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-07-25 13:36:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-07-25 13:36:54,088 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 445 [2018-07-25 13:36:54,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:54,089 INFO L472 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-07-25 13:36:54,089 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:36:54,089 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-07-25 13:36:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-07-25 13:36:54,090 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:54,091 INFO L354 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 1, 1] [2018-07-25 13:36:54,091 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:54,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1950942262, now seen corresponding path program 89 times [2018-07-25 13:36:54,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 19936 backedges. 0 proven. 19936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:54,971 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:54,972 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:36:54,972 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:36:54,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:36:54,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4372, Invalid=4558, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:36:54,973 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 95 states. [2018-07-25 13:36:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:56,485 INFO L93 Difference]: Finished difference Result 460 states and 460 transitions. [2018-07-25 13:36:56,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:36:56,486 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 450 [2018-07-25 13:36:56,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:56,487 INFO L225 Difference]: With dead ends: 460 [2018-07-25 13:36:56,487 INFO L226 Difference]: Without dead ends: 459 [2018-07-25 13:36:56,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4363 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=12746, Invalid=21294, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:36:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-07-25 13:36:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 456. [2018-07-25 13:36:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-07-25 13:36:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 456 transitions. [2018-07-25 13:36:57,079 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 456 transitions. Word has length 450 [2018-07-25 13:36:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:57,079 INFO L472 AbstractCegarLoop]: Abstraction has 456 states and 456 transitions. [2018-07-25 13:36:57,079 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:36:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 456 transitions. [2018-07-25 13:36:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-07-25 13:36:57,081 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:57,081 INFO L354 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 1, 1] [2018-07-25 13:36:57,081 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:36:57,082 INFO L82 PathProgramCache]: Analyzing trace with hash 62837026, now seen corresponding path program 90 times [2018-07-25 13:36:57,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:58,081 INFO L134 CoverageAnalysis]: Checked inductivity of 20385 backedges. 0 proven. 20385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:58,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:58,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:36:58,082 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:36:58,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:36:58,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4466, Invalid=4654, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:36:58,084 INFO L87 Difference]: Start difference. First operand 456 states and 456 transitions. Second operand 96 states. [2018-07-25 13:36:59,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:59,792 INFO L93 Difference]: Finished difference Result 465 states and 465 transitions. [2018-07-25 13:36:59,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:36:59,792 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 455 [2018-07-25 13:36:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:59,794 INFO L225 Difference]: With dead ends: 465 [2018-07-25 13:36:59,794 INFO L226 Difference]: Without dead ends: 464 [2018-07-25 13:36:59,796 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4457 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=13024, Invalid=21758, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:36:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-07-25 13:37:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2018-07-25 13:37:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-07-25 13:37:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 461 transitions. [2018-07-25 13:37:00,465 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 461 transitions. Word has length 455 [2018-07-25 13:37:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:00,466 INFO L472 AbstractCegarLoop]: Abstraction has 461 states and 461 transitions. [2018-07-25 13:37:00,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:37:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 461 transitions. [2018-07-25 13:37:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-07-25 13:37:00,468 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:00,468 INFO L354 BasicCegarLoop]: trace histogram [92, 92, 92, 91, 91, 1, 1] [2018-07-25 13:37:00,468 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:00,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2067777610, now seen corresponding path program 91 times [2018-07-25 13:37:00,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:01,321 INFO L134 CoverageAnalysis]: Checked inductivity of 20839 backedges. 0 proven. 20839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:01,322 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:01,322 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:37:01,322 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:37:01,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:37:01,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4561, Invalid=4751, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:37:01,324 INFO L87 Difference]: Start difference. First operand 461 states and 461 transitions. Second operand 97 states. [2018-07-25 13:37:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:02,936 INFO L93 Difference]: Finished difference Result 470 states and 470 transitions. [2018-07-25 13:37:02,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:37:02,936 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 460 [2018-07-25 13:37:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:02,937 INFO L225 Difference]: With dead ends: 470 [2018-07-25 13:37:02,938 INFO L226 Difference]: Without dead ends: 469 [2018-07-25 13:37:02,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4552 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13305, Invalid=22227, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:37:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-07-25 13:37:03,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 466. [2018-07-25 13:37:03,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-07-25 13:37:03,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 466 transitions. [2018-07-25 13:37:03,553 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 466 transitions. Word has length 460 [2018-07-25 13:37:03,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:03,553 INFO L472 AbstractCegarLoop]: Abstraction has 466 states and 466 transitions. [2018-07-25 13:37:03,553 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:37:03,553 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 466 transitions. [2018-07-25 13:37:03,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2018-07-25 13:37:03,555 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:03,555 INFO L354 BasicCegarLoop]: trace histogram [93, 93, 93, 92, 92, 1, 1] [2018-07-25 13:37:03,555 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:03,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2026123870, now seen corresponding path program 92 times [2018-07-25 13:37:03,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 21298 backedges. 0 proven. 21298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:04,476 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:04,476 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:37:04,476 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:37:04,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:37:04,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4657, Invalid=4849, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:37:04,478 INFO L87 Difference]: Start difference. First operand 466 states and 466 transitions. Second operand 98 states. [2018-07-25 13:37:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:06,166 INFO L93 Difference]: Finished difference Result 475 states and 475 transitions. [2018-07-25 13:37:06,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:37:06,167 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 465 [2018-07-25 13:37:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:06,168 INFO L225 Difference]: With dead ends: 475 [2018-07-25 13:37:06,168 INFO L226 Difference]: Without dead ends: 474 [2018-07-25 13:37:06,170 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4648 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=13589, Invalid=22701, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:37:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-07-25 13:37:06,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2018-07-25 13:37:06,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-07-25 13:37:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 471 transitions. [2018-07-25 13:37:06,797 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 471 transitions. Word has length 465 [2018-07-25 13:37:06,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:06,797 INFO L472 AbstractCegarLoop]: Abstraction has 471 states and 471 transitions. [2018-07-25 13:37:06,797 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:37:06,797 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 471 transitions. [2018-07-25 13:37:06,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2018-07-25 13:37:06,799 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:06,799 INFO L354 BasicCegarLoop]: trace histogram [94, 94, 94, 93, 93, 1, 1] [2018-07-25 13:37:06,799 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:06,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1368585418, now seen corresponding path program 93 times [2018-07-25 13:37:06,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:06,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 21762 backedges. 0 proven. 21762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:07,646 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:07,646 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:37:07,647 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:37:07,648 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:37:07,648 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4754, Invalid=4948, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:37:07,648 INFO L87 Difference]: Start difference. First operand 471 states and 471 transitions. Second operand 99 states. [2018-07-25 13:37:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:09,310 INFO L93 Difference]: Finished difference Result 480 states and 480 transitions. [2018-07-25 13:37:09,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:37:09,310 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 470 [2018-07-25 13:37:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:09,312 INFO L225 Difference]: With dead ends: 480 [2018-07-25 13:37:09,312 INFO L226 Difference]: Without dead ends: 479 [2018-07-25 13:37:09,314 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4745 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13876, Invalid=23180, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:37:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-07-25 13:37:09,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 476. [2018-07-25 13:37:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2018-07-25 13:37:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 476 transitions. [2018-07-25 13:37:09,997 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 476 transitions. Word has length 470 [2018-07-25 13:37:09,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:09,997 INFO L472 AbstractCegarLoop]: Abstraction has 476 states and 476 transitions. [2018-07-25 13:37:09,998 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:37:09,998 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 476 transitions. [2018-07-25 13:37:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2018-07-25 13:37:09,999 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:10,000 INFO L354 BasicCegarLoop]: trace histogram [95, 95, 95, 94, 94, 1, 1] [2018-07-25 13:37:10,000 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:10,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1913072162, now seen corresponding path program 94 times [2018-07-25 13:37:10,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 22231 backedges. 0 proven. 22231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:10,892 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:10,892 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:37:10,892 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:37:10,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:37:10,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4852, Invalid=5048, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:37:10,894 INFO L87 Difference]: Start difference. First operand 476 states and 476 transitions. Second operand 100 states. [2018-07-25 13:37:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:12,608 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-07-25 13:37:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:37:12,608 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 475 [2018-07-25 13:37:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:12,610 INFO L225 Difference]: With dead ends: 485 [2018-07-25 13:37:12,610 INFO L226 Difference]: Without dead ends: 484 [2018-07-25 13:37:12,613 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4843 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=14166, Invalid=23664, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:37:12,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-07-25 13:37:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 481. [2018-07-25 13:37:13,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 481 states. [2018-07-25 13:37:13,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 481 transitions. [2018-07-25 13:37:13,277 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 481 transitions. Word has length 475 [2018-07-25 13:37:13,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:13,277 INFO L472 AbstractCegarLoop]: Abstraction has 481 states and 481 transitions. [2018-07-25 13:37:13,278 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:37:13,278 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 481 transitions. [2018-07-25 13:37:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2018-07-25 13:37:13,279 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:13,279 INFO L354 BasicCegarLoop]: trace histogram [96, 96, 96, 95, 95, 1, 1] [2018-07-25 13:37:13,280 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1563984202, now seen corresponding path program 95 times [2018-07-25 13:37:13,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:13,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 22705 backedges. 0 proven. 22705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:14,362 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:14,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:37:14,363 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:37:14,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:37:14,365 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4951, Invalid=5149, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:37:14,365 INFO L87 Difference]: Start difference. First operand 481 states and 481 transitions. Second operand 101 states. [2018-07-25 13:37:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:16,096 INFO L93 Difference]: Finished difference Result 490 states and 490 transitions. [2018-07-25 13:37:16,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:37:16,096 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 480 [2018-07-25 13:37:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:16,098 INFO L225 Difference]: With dead ends: 490 [2018-07-25 13:37:16,098 INFO L226 Difference]: Without dead ends: 489 [2018-07-25 13:37:16,101 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4942 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=14459, Invalid=24153, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:37:16,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-07-25 13:37:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2018-07-25 13:37:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 486 states. [2018-07-25 13:37:16,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 486 transitions. [2018-07-25 13:37:16,778 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 486 transitions. Word has length 480 [2018-07-25 13:37:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:16,778 INFO L472 AbstractCegarLoop]: Abstraction has 486 states and 486 transitions. [2018-07-25 13:37:16,778 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:37:16,778 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 486 transitions. [2018-07-25 13:37:16,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2018-07-25 13:37:16,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:16,780 INFO L354 BasicCegarLoop]: trace histogram [97, 97, 97, 96, 96, 1, 1] [2018-07-25 13:37:16,780 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:16,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1034479266, now seen corresponding path program 96 times [2018-07-25 13:37:16,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:16,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 23184 backedges. 0 proven. 23184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:17,717 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:17,717 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:37:17,717 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:37:17,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:37:17,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5051, Invalid=5251, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:37:17,719 INFO L87 Difference]: Start difference. First operand 486 states and 486 transitions. Second operand 102 states. [2018-07-25 13:37:19,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:19,481 INFO L93 Difference]: Finished difference Result 495 states and 495 transitions. [2018-07-25 13:37:19,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:37:19,481 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 485 [2018-07-25 13:37:19,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:19,483 INFO L225 Difference]: With dead ends: 495 [2018-07-25 13:37:19,483 INFO L226 Difference]: Without dead ends: 494 [2018-07-25 13:37:19,486 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5042 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=14755, Invalid=24647, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:37:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-07-25 13:37:20,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 491. [2018-07-25 13:37:20,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-07-25 13:37:20,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2018-07-25 13:37:20,181 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 485 [2018-07-25 13:37:20,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:20,181 INFO L472 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2018-07-25 13:37:20,181 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:37:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2018-07-25 13:37:20,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-07-25 13:37:20,183 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:20,183 INFO L354 BasicCegarLoop]: trace histogram [98, 98, 98, 97, 97, 1, 1] [2018-07-25 13:37:20,184 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:20,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1656253898, now seen corresponding path program 97 times [2018-07-25 13:37:20,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 23668 backedges. 0 proven. 23668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:21,145 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:21,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:37:21,146 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:37:21,146 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:37:21,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5152, Invalid=5354, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:37:21,147 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 103 states. [2018-07-25 13:37:22,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:22,944 INFO L93 Difference]: Finished difference Result 500 states and 500 transitions. [2018-07-25 13:37:22,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:37:22,944 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 490 [2018-07-25 13:37:22,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:22,946 INFO L225 Difference]: With dead ends: 500 [2018-07-25 13:37:22,946 INFO L226 Difference]: Without dead ends: 499 [2018-07-25 13:37:22,949 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5143 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15054, Invalid=25146, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:37:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-07-25 13:37:23,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 496. [2018-07-25 13:37:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2018-07-25 13:37:23,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 496 transitions. [2018-07-25 13:37:23,653 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 496 transitions. Word has length 490 [2018-07-25 13:37:23,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:23,653 INFO L472 AbstractCegarLoop]: Abstraction has 496 states and 496 transitions. [2018-07-25 13:37:23,653 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:37:23,653 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 496 transitions. [2018-07-25 13:37:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-07-25 13:37:23,656 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:23,656 INFO L354 BasicCegarLoop]: trace histogram [99, 99, 99, 98, 98, 1, 1] [2018-07-25 13:37:23,657 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:23,657 INFO L82 PathProgramCache]: Analyzing trace with hash 430506786, now seen corresponding path program 98 times [2018-07-25 13:37:23,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 24157 backedges. 0 proven. 24157 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:24,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:24,652 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:37:24,652 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:37:24,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:37:24,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5254, Invalid=5458, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:37:24,654 INFO L87 Difference]: Start difference. First operand 496 states and 496 transitions. Second operand 104 states. [2018-07-25 13:37:26,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:26,457 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-07-25 13:37:26,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:37:26,458 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 495 [2018-07-25 13:37:26,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:26,460 INFO L225 Difference]: With dead ends: 505 [2018-07-25 13:37:26,460 INFO L226 Difference]: Without dead ends: 504 [2018-07-25 13:37:26,464 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5245 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15356, Invalid=25650, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:37:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-07-25 13:37:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 501. [2018-07-25 13:37:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-07-25 13:37:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2018-07-25 13:37:27,188 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 495 [2018-07-25 13:37:27,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:27,189 INFO L472 AbstractCegarLoop]: Abstraction has 501 states and 501 transitions. [2018-07-25 13:37:27,189 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:37:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 501 transitions. [2018-07-25 13:37:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-07-25 13:37:27,190 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:27,191 INFO L354 BasicCegarLoop]: trace histogram [100, 100, 100, 99, 99, 1, 1] [2018-07-25 13:37:27,191 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:27,191 INFO L82 PathProgramCache]: Analyzing trace with hash -479902282, now seen corresponding path program 99 times [2018-07-25 13:37:27,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 24651 backedges. 0 proven. 24651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:28,224 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:28,224 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:37:28,225 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:37:28,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:37:28,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5357, Invalid=5563, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:37:28,226 INFO L87 Difference]: Start difference. First operand 501 states and 501 transitions. Second operand 105 states. [2018-07-25 13:37:30,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:30,044 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-07-25 13:37:30,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:37:30,045 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 500 [2018-07-25 13:37:30,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:30,046 INFO L225 Difference]: With dead ends: 508 [2018-07-25 13:37:30,046 INFO L226 Difference]: Without dead ends: 507 [2018-07-25 13:37:30,049 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5348 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=15661, Invalid=26159, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:37:30,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-07-25 13:37:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 506. [2018-07-25 13:37:30,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-07-25 13:37:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 506 transitions. [2018-07-25 13:37:30,788 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 506 transitions. Word has length 500 [2018-07-25 13:37:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:30,789 INFO L472 AbstractCegarLoop]: Abstraction has 506 states and 506 transitions. [2018-07-25 13:37:30,789 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:37:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 506 transitions. [2018-07-25 13:37:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-07-25 13:37:30,791 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:30,791 INFO L354 BasicCegarLoop]: trace histogram [101, 101, 101, 100, 100, 1, 1] [2018-07-25 13:37:30,791 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2018-07-25 13:37:30,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1804566434, now seen corresponding path program 100 times [2018-07-25 13:37:30,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 25150 backedges. 24554 proven. 596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:31,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:31,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:37:31,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:37:31,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:37:31,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5155, Invalid=5557, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:37:31,666 INFO L87 Difference]: Start difference. First operand 506 states and 506 transitions. Second operand 104 states. [2018-07-25 13:37:32,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:32,772 INFO L93 Difference]: Finished difference Result 509 states and 509 transitions. [2018-07-25 13:37:32,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:37:32,772 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 505 [2018-07-25 13:37:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:32,772 INFO L225 Difference]: With dead ends: 509 [2018-07-25 13:37:32,772 INFO L226 Difference]: Without dead ends: 0 [2018-07-25 13:37:32,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5258, Invalid=5662, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:37:32,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-25 13:37:32,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-25 13:37:32,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-25 13:37:32,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-25 13:37:32,776 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 505 [2018-07-25 13:37:32,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:32,776 INFO L472 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-25 13:37:32,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:37:32,776 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-25 13:37:32,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-25 13:37:32,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-25 13:37:48,076 WARN L169 SmtUtils]: Spent 15.28 s on a formula simplification. DAG size of input: 1017 DAG size of output: 815 [2018-07-25 13:37:48,877 WARN L169 SmtUtils]: Spent 795.00 ms on a formula simplification that was a NOOP. DAG size: 812 [2018-07-25 13:37:59,987 WARN L169 SmtUtils]: Spent 11.11 s on a formula simplification. DAG size of input: 1015 DAG size of output: 813 [2018-07-25 13:38:12,559 WARN L169 SmtUtils]: Spent 12.57 s on a formula simplification. DAG size of input: 1020 DAG size of output: 812 [2018-07-25 13:38:13,331 WARN L169 SmtUtils]: Spent 768.00 ms on a formula simplification that was a NOOP. DAG size: 812 [2018-07-25 13:38:17,794 WARN L169 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 815 DAG size of output: 815 [2018-07-25 13:38:21,558 WARN L169 SmtUtils]: Spent 3.75 s on a formula simplification. DAG size of input: 812 DAG size of output: 811 [2018-07-25 13:38:24,723 WARN L169 SmtUtils]: Spent 3.16 s on a formula simplification. DAG size of input: 813 DAG size of output: 813 [2018-07-25 13:38:27,884 WARN L169 SmtUtils]: Spent 3.15 s on a formula simplification. DAG size of input: 811 DAG size of output: 810 [2018-07-25 13:38:31,456 WARN L169 SmtUtils]: Spent 3.56 s on a formula simplification. DAG size of input: 812 DAG size of output: 811 [2018-07-25 13:38:31,463 INFO L422 ceAbstractionStarter]: For program point L33(lines 1 34) no Hoare annotation was computed. [2018-07-25 13:38:31,463 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startEXIT(lines 41 46) the Hoare annotation is: (select |#valid| ULTIMATE.start_main_~q~1.base) [2018-07-25 13:38:31,475 INFO L418 ceAbstractionStarter]: At program point L58(line 58) the Hoare annotation is: (let ((.cse2 (select |#length| |ULTIMATE.start_read~int_#ptr.base|))) (let ((.cse4 (= |ULTIMATE.start_read~int_#ptr.base| ULTIMATE.start_main_~q~1.base)) (.cse6 (= 400 .cse2)) (.cse5 (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset|)) (.cse1 (select |#valid| ULTIMATE.start_main_~q~1.base)) (.cse3 (select |#length| ULTIMATE.start_main_~q~1.base)) (.cse0 (select |#valid| |ULTIMATE.start_read~int_#ptr.base|))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 48) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 348) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 52) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 276) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 124) .cse3) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 120) .cse2)) (and .cse0 .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 292) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 108) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 104) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 128) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 272) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 124) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 24) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 376) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 372) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 248) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 148) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 152) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 40) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 360) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 36) .cse2) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 356) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 44) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 352) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 204) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 208) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 192) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 364) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 36) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 32) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 112) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 116) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 284) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 84) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 312) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 88) .cse3)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 216) .cse2) .cse1 .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 220) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 180) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 176) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 224) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 172) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 164) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 168) .cse3) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 232) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 96) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 304) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 92) .cse2) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 316) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 84) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 312) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 48) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 348) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 352) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 36) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 360) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 364) .cse3) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 224) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 172) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 228) .cse3) .cse0) (and .cse4 (<= .cse5 4) .cse6 (= ULTIMATE.start_main_~p~1.offset ULTIMATE.start_main_~q~1.offset) .cse1 (<= ULTIMATE.start_main_~p~1.offset 0)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 320) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 316) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 80) ULTIMATE.start_main_~q~1.offset)) (and .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 8) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 12) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 388) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 120) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 280) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 116) .cse2) .cse0 .cse1) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 136) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 140) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 260) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1) (and (<= ULTIMATE.start_main_~q~1.offset 4) .cse4 .cse6 .cse1 (<= .cse5 8) (<= (+ ULTIMATE.start_main_~p~1.offset 4) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 4) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 392) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 8) .cse3) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 288) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 284) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 112) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 372) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 28) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 24) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 68) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 332) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 64) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 264) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 268) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 132) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 128) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 132) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 268) ULTIMATE.start_main_~q~1.offset) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 180) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 220) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 176) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 56) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 340) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 344) .cse3)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 204) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 196) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 200) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 248) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 244) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 152) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 132) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 264) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 136) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 244) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 240) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 156) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 240) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 236) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 160) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 56) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 340) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 60) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 308) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 92) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 88) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 280) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 120) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 276) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 140) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 144) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 256) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 236) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 164) .cse3) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 160) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 344) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 348) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 52) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 368) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 372) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 28) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 212) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 184) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 216) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 192) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 208) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 188) .cse2) .cse1 .cse0) (and .cse1 .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 20) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 380) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 16) .cse2)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 64) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 336) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 332) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 296) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 300) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 100) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 184) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 216) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 180) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 308) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 92) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 304) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 160) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 156) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 240) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 104) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 292) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 296) .cse3)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 80) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 84) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 316) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 260) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 140) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 256) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 376) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 20) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 24) .cse3)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 168) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 172) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 228) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 28) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 368) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 32) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 188) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 212) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 208) .cse2) .cse1 .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 344) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 52) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 56) .cse3)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 8) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 392) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 388) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 324) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 320) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 76) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 60) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 336) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 340) .cse3) .cse1 .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 244) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 156) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 152) .cse2) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 148) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 252) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 248) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 112) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 288) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 108) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 44) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 40) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 356) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 204) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 192) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 196) .cse3) .cse0) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 328) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 332) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 68) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 80) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 320) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 76) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 296) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 104) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 100) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 252) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 144) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 148) .cse3) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 304) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 96) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 300) .cse2) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 384) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 16) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 380) .cse2)) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 72) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 324) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 76) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 72) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 328) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 324) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 40) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 360) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 356) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 312) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 308) .cse2) .cse1 .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 88) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 260) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 136) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 264) .cse3) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 300) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 100) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 96) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 12) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 388) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 384) .cse2) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 368) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 32) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 364) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 4) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 396) ULTIMATE.start_main_~q~1.offset) (<= .cse5 .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 212) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 184) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 188) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 236) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 232) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 164) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 108) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 292) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 288) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 124) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 272) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 276) .cse3)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 252) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 256) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 144) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 20) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 376) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 380) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 352) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 48) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 44) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 64) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 60) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 336) ULTIMATE.start_main_~q~1.offset) .cse1) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 220) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 176) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 224) .cse3) .cse0) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 268) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 272) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 128) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 232) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 168) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 228) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 384) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 12) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 16) .cse3)) (and .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 196) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 200) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 200) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 72) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 328) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 68) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 280) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 284) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 116) ULTIMATE.start_main_~q~1.offset) .cse0)))) [2018-07-25 13:38:31,481 INFO L418 ceAbstractionStarter]: At program point L58-1(lines 58 59) the Hoare annotation is: (let ((.cse2 (select |#length| |ULTIMATE.start_read~int_#ptr.base|))) (let ((.cse4 (= |ULTIMATE.start_read~int_#ptr.base| ULTIMATE.start_main_~q~1.base)) (.cse6 (= 400 .cse2)) (.cse5 (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset|)) (.cse1 (select |#valid| ULTIMATE.start_main_~q~1.base)) (.cse3 (select |#length| ULTIMATE.start_main_~q~1.base)) (.cse0 (select |#valid| |ULTIMATE.start_read~int_#ptr.base|))) (or (and .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 48) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 348) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 52) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 276) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 124) .cse3) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 120) .cse2)) (and .cse0 .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 292) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 108) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 104) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 128) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 272) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 124) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 24) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 376) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 372) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 248) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 148) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 152) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 40) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 360) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 36) .cse2) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 356) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 44) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 352) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 204) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 208) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 192) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 364) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 36) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 32) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 112) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 116) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 284) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 84) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 312) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 88) .cse3)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 216) .cse2) .cse1 .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 220) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 180) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 176) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 224) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 172) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 164) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 168) .cse3) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 232) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 96) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 304) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 92) .cse2) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 316) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 84) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 312) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 48) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 348) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 352) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 36) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 360) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 364) .cse3) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 224) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 172) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 228) .cse3) .cse0) (and .cse4 (<= .cse5 4) .cse6 (= ULTIMATE.start_main_~p~1.offset ULTIMATE.start_main_~q~1.offset) .cse1 (<= ULTIMATE.start_main_~p~1.offset 0)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 320) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 316) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 80) ULTIMATE.start_main_~q~1.offset)) (and .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 8) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 12) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 388) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 120) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 280) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 116) .cse2) .cse0 .cse1) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 136) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 140) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 260) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1) (and (<= ULTIMATE.start_main_~q~1.offset 4) .cse4 .cse6 .cse1 (<= .cse5 8) (<= (+ ULTIMATE.start_main_~p~1.offset 4) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 4) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 392) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 8) .cse3) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 288) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 284) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 112) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 372) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 28) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 24) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 68) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 332) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 64) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 264) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 268) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 132) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 128) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 132) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 268) ULTIMATE.start_main_~q~1.offset) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 180) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 220) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 176) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 56) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 340) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 344) .cse3)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 204) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 196) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 200) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 248) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 244) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 152) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 132) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 264) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 136) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 244) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 240) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 156) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 240) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 236) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 160) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 56) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 340) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 60) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 308) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 92) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 88) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 280) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 120) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 276) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 140) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 144) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 256) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 236) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 164) .cse3) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 160) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 344) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 348) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 52) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 368) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 372) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 28) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 212) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 184) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 216) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 192) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 208) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 188) .cse2) .cse1 .cse0) (and .cse1 .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 20) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 380) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 16) .cse2)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 64) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 336) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 332) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 296) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 300) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 100) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 184) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 216) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 180) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 308) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 92) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 304) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 160) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 156) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 240) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 104) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 292) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 296) .cse3)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 80) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 84) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 316) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 260) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 140) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 256) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 376) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 20) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 24) .cse3)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 168) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 172) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 228) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 28) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 368) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 32) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 188) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 212) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 208) .cse2) .cse1 .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 344) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 52) .cse2) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 56) .cse3)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 8) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 392) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 388) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 324) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 320) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 76) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 60) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 336) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 340) .cse3) .cse1 .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 244) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 156) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 152) .cse2) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 148) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 252) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 248) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 112) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 288) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 108) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 44) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 40) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 356) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 204) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 192) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 196) .cse3) .cse0) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 328) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 332) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 68) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 80) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 320) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 76) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 296) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 104) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 100) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 252) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 144) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 148) .cse3) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 304) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 96) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 300) .cse2) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 384) .cse3) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 16) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 380) .cse2)) (and .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 72) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 324) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 76) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 72) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 328) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 324) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 40) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 360) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 356) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 312) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 308) .cse2) .cse1 .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 88) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 260) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 136) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 264) .cse3) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 300) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 100) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 96) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 12) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 388) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 384) .cse2) .cse0 .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 368) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 32) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 364) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 4) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 396) ULTIMATE.start_main_~q~1.offset) (<= .cse5 .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 212) ULTIMATE.start_main_~q~1.offset) .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 184) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 188) .cse3)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 236) .cse3) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 232) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 164) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 108) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 292) .cse3) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 288) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 124) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 272) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 276) .cse3)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 252) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 256) .cse3) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 144) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 20) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 376) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 380) .cse3)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 352) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 48) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 44) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 64) .cse3) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 60) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 336) ULTIMATE.start_main_~q~1.offset) .cse1) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 220) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 176) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 224) .cse3) .cse0) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 268) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 272) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 128) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 232) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 168) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 228) .cse2) .cse0) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 384) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 12) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 16) .cse3)) (and .cse1 .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 196) .cse2) (<= (+ ULTIMATE.start_main_~q~1.offset 200) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 200) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 72) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 328) ULTIMATE.start_main_~q~1.offset) .cse0 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 68) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 280) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 284) .cse3) (<= (+ ULTIMATE.start_main_~p~1.offset 116) ULTIMATE.start_main_~q~1.offset) .cse0)))) [2018-07-25 13:38:31,482 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT(lines 58 59) the Hoare annotation is: false [2018-07-25 13:38:31,487 INFO L418 ceAbstractionStarter]: At program point L19(lines 15 27) the Hoare annotation is: (let ((.cse5 (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset|)) (.cse0 (select |#length| |ULTIMATE.start_read~int_#ptr.base|))) (let ((.cse3 (= |ULTIMATE.start_read~int_#ptr.base| ULTIMATE.start_main_~q~1.base)) (.cse4 (= 400 .cse0)) (.cse6 (<= .cse5 .cse0)) (.cse2 (select |#length| ULTIMATE.start_main_~q~1.base)) (.cse1 (select |#valid| ULTIMATE.start_main_~q~1.base))) (or (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 188) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 204) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 196) .cse2)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 376) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 16) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 24) .cse2)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 256) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 248) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 144) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (not |ULTIMATE.start_main_#t~short2|)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 48) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 344) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 352) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 384) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 376) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 16) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 72) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 328) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 64) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 212) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 220) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 180) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 140) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 252) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 148) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 144) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 136) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 256) ULTIMATE.start_main_~q~1.offset) .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 120) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 280) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 112) .cse0) .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 112) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 288) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 104) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 132) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 268) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 124) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 160) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 152) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 240) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 372) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 28) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 20) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 24) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 376) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 368) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 96) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 304) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 88) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 12) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 388) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 380) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 236) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 164) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 228) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 296) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 304) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 96) ULTIMATE.start_main_~q~1.offset) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 300) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 100) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 292) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 300) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 92) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 100) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 216) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 176) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 184) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 240) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 160) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 232) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 168) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 176) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 224) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 220) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 172) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 180) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 60) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 68) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 332) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 44) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 36) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 356) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 128) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 264) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 136) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 244) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 148) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 156) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~q~1.offset 208) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 192) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 200) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 324) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 316) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 76) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 184) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 208) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 216) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 280) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 288) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 112) ULTIMATE.start_main_~q~1.offset)) (and .cse3 .cse4 (= ULTIMATE.start_main_~p~1.offset ULTIMATE.start_main_~q~1.offset) .cse1 (<= .cse5 8) (<= ULTIMATE.start_main_~p~1.offset 0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 312) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 304) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 88) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 204) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 196) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 196) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 384) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 8) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 392) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 264) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 272) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 128) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 116) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 284) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 108) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 368) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 32) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 360) .cse0) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 104) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 288) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 296) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 224) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 232) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 168) ULTIMATE.start_main_~q~1.offset) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 148) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 252) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 244) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 28) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 364) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 36) .cse2)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 284) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 108) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 292) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 244) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 236) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 156) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 128) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 272) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 120) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 352) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 40) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 48) .cse2)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 364) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 28) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 372) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 220) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 172) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 228) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 384) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 8) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 16) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 76) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 84) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 316) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 80) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 320) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 72) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 52) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 340) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 60) .cse2)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 320) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 312) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 80) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 124) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 268) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 276) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 20) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 372) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 380) .cse2)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 80) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 88) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 312) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 236) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 164) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 156) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 296) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 104) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 96) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 344) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 48) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 56) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 260) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 268) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 132) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 192) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 208) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 184) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 40) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 360) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 352) .cse0)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 20) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 380) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 12) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 308) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 84) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 92) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 60) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 340) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 332) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 164) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 172) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 228) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 216) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 176) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 224) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 100) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 292) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 108) .cse2)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 136) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 256) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 264) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 64) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 336) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 56) .cse0) .cse1) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 392) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 8) .cse2) .cse6) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 192) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 200) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 200) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 328) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 64) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 336) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 308) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 92) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 300) .cse0)) (and .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 44) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 348) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 52) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 132) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 140) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 260) ULTIMATE.start_main_~q~1.offset) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 188) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 204) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 212) .cse2) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 212) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 180) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 188) .cse2)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 356) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 44) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 348) .cse0)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 332) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 68) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 324) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 280) .cse2) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 272) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 120) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 248) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 144) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 152) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 336) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 56) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 344) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 348) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 52) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 340) .cse0)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 284) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 116) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 276) .cse0)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 324) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 76) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 68) .cse0)) (and (<= ULTIMATE.start_main_~q~1.offset 4) .cse3 .cse4 .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 388) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 4) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 316) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 308) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 84) ULTIMATE.start_main_~q~1.offset) .cse1) (and (<= (+ ULTIMATE.start_main_~p~1.offset 276) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 116) .cse0) (<= (+ ULTIMATE.start_main_~q~1.offset 124) .cse2) .cse1) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 240) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 248) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 152) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 396) ULTIMATE.start_main_~q~1.offset) .cse6) (and (<= (+ ULTIMATE.start_main_~p~1.offset 72) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 328) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 320) .cse0)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 36) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 364) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 356) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 168) .cse2) .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 232) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 160) .cse0)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 4) .cse0) .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 12) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 388) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ ULTIMATE.start_main_~q~1.offset 40) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 32) .cse0) (<= (+ ULTIMATE.start_main_~p~1.offset 360) ULTIMATE.start_main_~q~1.offset)) (and .cse1 (<= (+ ULTIMATE.start_main_~p~1.offset 368) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 32) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 24) .cse0)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 260) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 140) ULTIMATE.start_main_~q~1.offset) .cse1 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 252) .cse0))))) [2018-07-25 13:38:31,491 INFO L418 ceAbstractionStarter]: At program point L15(lines 15 18) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset|)) (.cse1 (select |#length| |ULTIMATE.start_read~int_#ptr.base|))) (let ((.cse3 (<= .cse4 .cse1)) (.cse0 (select |#valid| ULTIMATE.start_main_~q~1.base)) (.cse2 (select |#length| ULTIMATE.start_main_~q~1.base))) (or (and (<= (+ ULTIMATE.start_main_~p~1.offset 48) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 348) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 352) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 292) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 108) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 104) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 64) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 336) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 332) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 124) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 272) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 276) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 132) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 264) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 136) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 364) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 32) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 36) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 304) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 96) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 300) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 372) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 28) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 24) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 236) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 232) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 164) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 260) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 140) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 256) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 64) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 60) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 336) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 324) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 320) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 76) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 20) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 380) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 16) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 24) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 376) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 372) .cse1) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 220) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 176) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 224) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 296) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 300) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 100) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 40) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 360) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 356) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 244) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 240) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 156) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 176) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 224) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 172) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 368) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 32) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 364) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 204) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 196) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 200) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 232) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 168) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 228) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 40) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 360) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 36) .cse1) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 4) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 392) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 8) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 84) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 312) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 88) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 280) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 284) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 116) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 108) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 292) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 288) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 96) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 304) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 92) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 384) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 16) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 380) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 164) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 168) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 232) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 376) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 20) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 24) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 308) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 92) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 304) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 296) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 104) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 100) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 204) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 192) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 196) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 356) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 44) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 352) .cse1)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 368) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 28) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 372) .cse2)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 80) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 84) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 316) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 212) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 184) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 216) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 316) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 84) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 312) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 320) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 316) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 80) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 252) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 256) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 144) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 260) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 136) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 264) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 308) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 92) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 88) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 280) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 120) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 276) .cse1)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 196) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 200) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 200) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 344) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 52) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 56) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 56) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 340) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 344) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 140) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 144) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 256) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 80) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 320) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 76) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 220) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 176) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 180) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 248) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 244) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 152) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 112) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 288) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 108) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 36) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 360) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 364) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 264) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 268) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 132) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 276) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 124) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 120) .cse1)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 328) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 332) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 68) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 104) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 292) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 296) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 68) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 332) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 64) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 148) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 252) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 248) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 216) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 220) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 180) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 136) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 140) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 260) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 160) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 156) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 240) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 20) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 376) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 380) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 12) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 388) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 384) .cse1) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 344) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 348) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 52) ULTIMATE.start_main_~q~1.offset) .cse0) (and .cse0 (not |ULTIMATE.start_main_#t~short2|) .cse3 (<= (+ ULTIMATE.start_main_~p~1.offset 400) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 352) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 48) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 44) .cse1)) (and (<= ULTIMATE.start_main_~q~1.offset 4) (= |ULTIMATE.start_read~int_#ptr.base| ULTIMATE.start_main_~q~1.base) (= 400 .cse1) .cse0 (<= .cse4 8) (<= (+ ULTIMATE.start_main_~p~1.offset 4) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 312) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 308) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 88) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 128) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 132) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 268) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 72) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 328) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 68) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 28) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 368) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 32) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 300) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 100) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 96) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 112) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 116) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 284) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 8) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 392) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 388) .cse1)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 8) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 12) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 388) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 204) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 208) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 192) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 56) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 340) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 60) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 240) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 236) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 160) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 120) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 280) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 116) .cse1) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 4) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 396) ULTIMATE.start_main_~q~1.offset) .cse3) (and (<= (+ ULTIMATE.start_main_~q~1.offset 44) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 40) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 356) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 268) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 272) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 128) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 128) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 272) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 124) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 248) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 148) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 152) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 244) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 156) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 152) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 188) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 212) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 208) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 288) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 284) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 112) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 252) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 144) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 148) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 72) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 328) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 324) .cse1)) (and .cse0 (<= ULTIMATE.start_main_~p~1.offset 0) (= ULTIMATE.start_main_~p~1.offset ULTIMATE.start_main_~q~1.offset) (= 400 .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 236) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 164) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 160) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 212) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 184) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 188) .cse2)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 72) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 324) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 76) .cse2)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 48) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 348) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 52) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 168) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 172) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 228) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 192) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 208) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 188) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 60) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 336) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 340) .cse2) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 224) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 172) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 228) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 384) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 12) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 16) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 184) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 216) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 180) .cse1))))) [2018-07-25 13:38:31,492 INFO L422 ceAbstractionStarter]: For program point L36(lines 36 39) no Hoare annotation was computed. [2018-07-25 13:38:31,492 INFO L425 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 41 46) the Hoare annotation is: true [2018-07-25 13:38:31,492 INFO L422 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 41 46) no Hoare annotation was computed. [2018-07-25 13:38:31,497 INFO L418 ceAbstractionStarter]: At program point L12-1(lines 12 31) the Hoare annotation is: (let ((.cse3 (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset|)) (.cse1 (select |#length| |ULTIMATE.start_read~int_#ptr.base|))) (let ((.cse4 (<= .cse3 .cse1)) (.cse0 (select |#valid| ULTIMATE.start_main_~q~1.base)) (.cse2 (select |#length| ULTIMATE.start_main_~q~1.base))) (or (and (<= (+ ULTIMATE.start_main_~p~1.offset 48) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 348) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 352) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 292) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 108) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 104) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 64) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 336) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 332) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 124) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 272) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 276) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 132) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 264) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 136) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 364) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 32) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 36) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 304) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 96) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 300) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 372) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 28) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 24) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 236) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 232) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 164) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 260) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 140) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 256) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 64) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 60) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 336) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 324) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 320) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 76) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 20) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 380) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 16) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 24) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 376) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 372) .cse1) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 220) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 176) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 224) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 296) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 300) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 100) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 40) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 360) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 356) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 244) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 240) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 156) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 176) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 224) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 172) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 368) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 32) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 364) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 204) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 196) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 200) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 232) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 168) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 228) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 40) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 360) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 36) .cse1) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 4) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 392) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 8) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 84) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 312) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 88) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 280) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 284) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 116) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 108) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 292) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 288) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 96) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 304) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 92) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 384) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 16) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 380) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 164) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 168) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 232) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 376) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 20) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 24) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 308) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 92) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 304) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 296) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 104) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 100) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 204) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 192) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 196) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 356) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 44) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 352) .cse1)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 368) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 28) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 372) .cse2)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 80) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 84) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 316) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 212) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 184) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 216) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 316) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 84) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 312) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 320) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 316) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 80) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 252) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 256) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 144) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 260) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 136) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 264) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 308) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 92) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 88) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 280) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 120) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 276) .cse1)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 196) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 200) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 200) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 344) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 52) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 56) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 56) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 340) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 344) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 140) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 144) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 256) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 80) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 320) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 76) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 220) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 176) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 180) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 248) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 244) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 152) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 112) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 288) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 108) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 36) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 360) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 364) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 264) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 268) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 132) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 276) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 124) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 120) .cse1)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 328) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 332) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 68) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 104) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 292) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 296) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 68) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 332) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 64) .cse1)) (and .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 148) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 252) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 248) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 216) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 220) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 180) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 136) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 140) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 260) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 160) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 156) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 240) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 20) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 376) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 380) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 12) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 388) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 384) .cse1) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 344) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 348) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 52) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 352) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 48) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 44) .cse1)) (and (<= ULTIMATE.start_main_~q~1.offset 4) (= |ULTIMATE.start_read~int_#ptr.base| ULTIMATE.start_main_~q~1.base) (= 400 .cse1) .cse0 (<= .cse3 8) (<= (+ ULTIMATE.start_main_~p~1.offset 4) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 312) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 308) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 88) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 128) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 132) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 268) ULTIMATE.start_main_~q~1.offset) .cse0) (and (<= (+ ULTIMATE.start_main_~q~1.offset 72) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 328) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 68) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 28) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 368) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 32) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 300) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 100) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 96) .cse1)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 112) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 116) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 284) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 8) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 392) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 388) .cse1)) (and .cse0 .cse4 (<= (+ ULTIMATE.start_main_~p~1.offset 400) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 8) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 12) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 388) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 204) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 208) .cse2) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 192) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 56) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 340) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 60) .cse2)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 240) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 236) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 160) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 120) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 280) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 116) .cse1) .cse0) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 4) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 396) ULTIMATE.start_main_~q~1.offset) .cse4) (and (<= (+ ULTIMATE.start_main_~q~1.offset 44) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 40) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~p~1.offset 356) ULTIMATE.start_main_~q~1.offset)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 268) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 272) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 128) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 128) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 272) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 124) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 248) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 148) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 152) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 244) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 156) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 152) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 188) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 212) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 208) .cse1)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 288) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 284) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 112) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 252) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 144) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 148) .cse2) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 72) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 328) .cse2) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 324) .cse1)) (and .cse0 (<= ULTIMATE.start_main_~p~1.offset 0) (= ULTIMATE.start_main_~p~1.offset ULTIMATE.start_main_~q~1.offset) (= 400 .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 236) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 164) .cse2) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 160) .cse1)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 212) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 184) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 188) .cse2)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 72) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 324) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 76) .cse2)) (and .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 48) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 348) ULTIMATE.start_main_~q~1.offset) (<= (+ ULTIMATE.start_main_~q~1.offset 52) .cse2)) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 168) .cse1) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 172) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 228) ULTIMATE.start_main_~q~1.offset)) (and (<= (+ ULTIMATE.start_main_~q~1.offset 192) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 208) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 188) .cse1) .cse0) (and (<= (+ ULTIMATE.start_main_~p~1.offset 60) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 336) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 340) .cse2) .cse0) (and (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 224) .cse1) (<= (+ ULTIMATE.start_main_~p~1.offset 172) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 228) .cse2)) (and (<= (+ ULTIMATE.start_main_~p~1.offset 384) ULTIMATE.start_main_~q~1.offset) .cse0 (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 12) .cse1) (<= (+ ULTIMATE.start_main_~q~1.offset 16) .cse2)) (and .cse0 (<= (+ ULTIMATE.start_main_~q~1.offset 184) .cse2) (<= (+ ULTIMATE.start_main_~p~1.offset 216) ULTIMATE.start_main_~q~1.offset) (<= (+ |ULTIMATE.start_read~int_#sizeOfReadType| |ULTIMATE.start_read~int_#ptr.offset| 180) .cse1))))) [2018-07-25 13:38:31,497 INFO L418 ceAbstractionStarter]: At program point L12-2(lines 12 31) the Hoare annotation is: (select |#valid| ULTIMATE.start_main_~q~1.base) [2018-07-25 13:38:31,497 INFO L418 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT(line 58) the Hoare annotation is: false [2018-07-25 13:38:31,580 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:38:31 BoogieIcfgContainer [2018-07-25 13:38:31,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:38:31,581 INFO L168 Benchmark]: Toolchain (without parser) took 211446.10 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 830.5 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -693.2 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-25 13:38:31,582 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 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-07-25 13:38:31,586 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.00 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-07-25 13:38:31,586 INFO L168 Benchmark]: Boogie Preprocessor took 23.89 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-07-25 13:38:31,586 INFO L168 Benchmark]: RCFGBuilder took 314.12 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:38:31,587 INFO L168 Benchmark]: TraceAbstraction took 211044.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 830.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -703.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-07-25 13:38:31,592 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.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.00 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 23.89 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 314.12 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: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 211044.64 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 830.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -703.8 MB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: procedure precondition always holds and assertion always holds For all program executions holds that procedure precondition always holds and assertion always holds at this location - PositiveResult [Line: 58]: procedure precondition always holds and assertion always holds For all program executions holds that procedure precondition always holds and assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: #valid[~q~1!base] - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((~p~1!offset + 48 <= ~q~1!offset && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 348 <= #length[#ptr!base]) && ~q~1!offset + 352 <= #length[~q~1!base]) || (((#valid[~q~1!base] && ~p~1!offset + 292 <= ~q~1!offset) && ~q~1!offset + 108 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 104 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~p~1!offset + 64 <= ~q~1!offset) && ~q~1!offset + 336 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 332 <= #length[#ptr!base])) || (((~p~1!offset + 124 <= ~q~1!offset && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 272 <= #length[#ptr!base]) && ~q~1!offset + 276 <= #length[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 132 <= #length[#ptr!base] && ~p~1!offset + 264 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 136 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~p~1!offset + 364 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 32 <= #length[#ptr!base]) && ~q~1!offset + 36 <= #length[~q~1!base])) || (((~q~1!offset + 304 <= #length[~q~1!base] && ~p~1!offset + 96 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 300 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~p~1!offset + 372 <= ~q~1!offset) && ~q~1!offset + 28 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 24 <= #length[#ptr!base])) || (((~q~1!offset + 236 <= #length[~q~1!base] && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 232 <= #length[#ptr!base]) && ~p~1!offset + 164 <= ~q~1!offset)) || (((~q~1!offset + 260 <= #length[~q~1!base] && ~p~1!offset + 140 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 256 <= #length[#ptr!base])) || (((~q~1!offset + 64 <= #length[~q~1!base] && #sizeOfReadType + #ptr!offset + 60 <= #length[#ptr!base]) && ~p~1!offset + 336 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 324 <= #length[~q~1!base] && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 320 <= #length[#ptr!base]) && ~p~1!offset + 76 <= ~q~1!offset)) || (((#valid[~q~1!base] && ~q~1!offset + 20 <= #length[~q~1!base]) && ~p~1!offset + 380 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 16 <= #length[#ptr!base])) || (((~p~1!offset + 24 <= ~q~1!offset && ~q~1!offset + 376 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 372 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 220 <= #length[#ptr!base] && #valid[~q~1!base]) && ~p~1!offset + 176 <= ~q~1!offset) && ~q~1!offset + 224 <= #length[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 296 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 300 <= #length[~q~1!base]) && ~p~1!offset + 100 <= ~q~1!offset)) || (((~p~1!offset + 40 <= ~q~1!offset && ~q~1!offset + 360 <= #length[~q~1!base]) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 356 <= #length[#ptr!base])) || (((~q~1!offset + 244 <= #length[~q~1!base] && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 240 <= #length[#ptr!base]) && ~p~1!offset + 156 <= ~q~1!offset)) || (((~q~1!offset + 176 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 224 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 172 <= #length[#ptr!base])) || (((~q~1!offset + 368 <= #length[~q~1!base] && ~p~1!offset + 32 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 364 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~q~1!offset + 204 <= #length[~q~1!base]) && ~p~1!offset + 196 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 200 <= #length[#ptr!base])) || (((~q~1!offset + 232 <= #length[~q~1!base] && ~p~1!offset + 168 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 228 <= #length[#ptr!base])) || (((~q~1!offset + 40 <= #length[~q~1!base] && ~p~1!offset + 360 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 36 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 4 <= #length[#ptr!base] && #valid[~q~1!base]) && ~p~1!offset + 392 <= ~q~1!offset) && ~q~1!offset + 8 <= #length[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 84 <= #length[#ptr!base] && ~p~1!offset + 312 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 88 <= #length[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 280 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 284 <= #length[~q~1!base]) && ~p~1!offset + 116 <= ~q~1!offset)) || (((#valid[~q~1!base] && ~p~1!offset + 108 <= ~q~1!offset) && ~q~1!offset + 292 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 288 <= #length[#ptr!base])) || (((~q~1!offset + 96 <= #length[~q~1!base] && ~p~1!offset + 304 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 92 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~q~1!offset + 384 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 16 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 380 <= #length[#ptr!base])) || (((#sizeOfReadType + #ptr!offset + 164 <= #length[#ptr!base] && ~q~1!offset + 168 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 232 <= ~q~1!offset)) || (((#valid[~q~1!base] && ~p~1!offset + 376 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 20 <= #length[#ptr!base]) && ~q~1!offset + 24 <= #length[~q~1!base])) || (((~q~1!offset + 308 <= #length[~q~1!base] && ~p~1!offset + 92 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 304 <= #length[#ptr!base])) || (((~p~1!offset + 296 <= ~q~1!offset && ~q~1!offset + 104 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 100 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~p~1!offset + 204 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 192 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 196 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~q~1!offset + 356 <= #length[~q~1!base]) && ~p~1!offset + 44 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 352 <= #length[#ptr!base])) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 368 <= #length[#ptr!base]) && ~p~1!offset + 28 <= ~q~1!offset) && ~q~1!offset + 372 <= #length[~q~1!base])) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 80 <= #length[#ptr!base]) && ~q~1!offset + 84 <= #length[~q~1!base]) && ~p~1!offset + 316 <= ~q~1!offset)) || (((#sizeOfReadType + #ptr!offset + 212 <= #length[#ptr!base] && ~p~1!offset + 184 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 216 <= #length[~q~1!base])) || (((~q~1!offset + 316 <= #length[~q~1!base] && ~p~1!offset + 84 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 312 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~q~1!offset + 320 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 316 <= #length[#ptr!base]) && ~p~1!offset + 80 <= ~q~1!offset)) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 252 <= #length[#ptr!base]) && ~q~1!offset + 256 <= #length[~q~1!base]) && ~p~1!offset + 144 <= ~q~1!offset)) || (((#sizeOfReadType + #ptr!offset + 260 <= #length[#ptr!base] && #valid[~q~1!base]) && ~p~1!offset + 136 <= ~q~1!offset) && ~q~1!offset + 264 <= #length[~q~1!base])) || (((~p~1!offset + 308 <= ~q~1!offset && ~q~1!offset + 92 <= #length[~q~1!base]) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 88 <= #length[#ptr!base])) || (((~q~1!offset + 280 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 120 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 276 <= #length[#ptr!base])) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 196 <= #length[#ptr!base]) && ~q~1!offset + 200 <= #length[~q~1!base]) && ~p~1!offset + 200 <= ~q~1!offset)) || (((~p~1!offset + 344 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 52 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 56 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~p~1!offset + 56 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 340 <= #length[#ptr!base]) && ~q~1!offset + 344 <= #length[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 140 <= #length[#ptr!base] && ~q~1!offset + 144 <= #length[~q~1!base]) && ~p~1!offset + 256 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 80 <= #length[~q~1!base] && ~p~1!offset + 320 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 76 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~p~1!offset + 220 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 176 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 180 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~q~1!offset + 248 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 244 <= #length[#ptr!base]) && ~p~1!offset + 152 <= ~q~1!offset)) || (((~q~1!offset + 112 <= #length[~q~1!base] && ~p~1!offset + 288 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 108 <= #length[#ptr!base])) || (((~p~1!offset + 36 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 360 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 364 <= #length[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 264 <= #length[#ptr!base] && ~q~1!offset + 268 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 132 <= ~q~1!offset)) || (((~p~1!offset + 276 <= ~q~1!offset && ~q~1!offset + 124 <= #length[~q~1!base]) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 120 <= #length[#ptr!base])) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 328 <= #length[#ptr!base]) && ~q~1!offset + 332 <= #length[~q~1!base]) && ~p~1!offset + 68 <= ~q~1!offset)) || (((~p~1!offset + 104 <= ~q~1!offset && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 292 <= #length[#ptr!base]) && ~q~1!offset + 296 <= #length[~q~1!base])) || (((~q~1!offset + 68 <= #length[~q~1!base] && #valid[~q~1!base]) && ~p~1!offset + 332 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 64 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~p~1!offset + 148 <= ~q~1!offset) && ~q~1!offset + 252 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 248 <= #length[#ptr!base])) || (((#sizeOfReadType + #ptr!offset + 216 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 220 <= #length[~q~1!base]) && ~p~1!offset + 180 <= ~q~1!offset)) || (((#sizeOfReadType + #ptr!offset + 136 <= #length[#ptr!base] && ~q~1!offset + 140 <= #length[~q~1!base]) && ~p~1!offset + 260 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 160 <= #length[~q~1!base] && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 156 <= #length[#ptr!base]) && ~p~1!offset + 240 <= ~q~1!offset)) || (((~p~1!offset + 20 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 376 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 380 <= #length[~q~1!base])) || (((~p~1!offset + 12 <= ~q~1!offset && ~q~1!offset + 388 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 384 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 344 <= #length[#ptr!base] && ~q~1!offset + 348 <= #length[~q~1!base]) && ~p~1!offset + 52 <= ~q~1!offset) && #valid[~q~1!base])) || (((~p~1!offset + 352 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 48 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 44 <= #length[#ptr!base])) || (((((~q~1!offset <= 4 && #ptr!base == ~q~1!base) && 400 == #length[#ptr!base]) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset <= 8) && ~p~1!offset + 4 <= ~q~1!offset)) || (((~q~1!offset + 312 <= #length[~q~1!base] && #sizeOfReadType + #ptr!offset + 308 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~p~1!offset + 88 <= ~q~1!offset)) || (((#sizeOfReadType + #ptr!offset + 128 <= #length[#ptr!base] && ~q~1!offset + 132 <= #length[~q~1!base]) && ~p~1!offset + 268 <= ~q~1!offset) && #valid[~q~1!base])) || (((~q~1!offset + 72 <= #length[~q~1!base] && ~p~1!offset + 328 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 68 <= #length[#ptr!base])) || (((#sizeOfReadType + #ptr!offset + 28 <= #length[#ptr!base] && #valid[~q~1!base]) && ~p~1!offset + 368 <= ~q~1!offset) && ~q~1!offset + 32 <= #length[~q~1!base])) || (((~p~1!offset + 300 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 100 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 96 <= #length[#ptr!base])) || (((#sizeOfReadType + #ptr!offset + 112 <= #length[#ptr!base] && ~q~1!offset + 116 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 284 <= ~q~1!offset)) || (((~p~1!offset + 8 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 392 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 388 <= #length[#ptr!base])) || ((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset <= #length[#ptr!base]) && ~p~1!offset + 400 <= ~q~1!offset)) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 8 <= #length[#ptr!base]) && ~q~1!offset + 12 <= #length[~q~1!base]) && ~p~1!offset + 388 <= ~q~1!offset)) || (((#sizeOfReadType + #ptr!offset + 204 <= #length[#ptr!base] && ~q~1!offset + 208 <= #length[~q~1!base]) && #valid[~q~1!base]) && ~p~1!offset + 192 <= ~q~1!offset)) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 56 <= #length[#ptr!base]) && ~p~1!offset + 340 <= ~q~1!offset) && ~q~1!offset + 60 <= #length[~q~1!base])) || (((~q~1!offset + 240 <= #length[~q~1!base] && #sizeOfReadType + #ptr!offset + 236 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~p~1!offset + 160 <= ~q~1!offset)) || (((~q~1!offset + 120 <= #length[~q~1!base] && ~p~1!offset + 280 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 116 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((#valid[~q~1!base] && ~q~1!offset + 4 <= #length[~q~1!base]) && ~p~1!offset + 396 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset <= #length[#ptr!base])) || (((~q~1!offset + 44 <= #length[~q~1!base] && #sizeOfReadType + #ptr!offset + 40 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~p~1!offset + 356 <= ~q~1!offset)) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 268 <= #length[#ptr!base]) && ~q~1!offset + 272 <= #length[~q~1!base]) && ~p~1!offset + 128 <= ~q~1!offset)) || (((~q~1!offset + 128 <= #length[~q~1!base] && ~p~1!offset + 272 <= ~q~1!offset) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 124 <= #length[#ptr!base])) || (((~p~1!offset + 248 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 148 <= #length[#ptr!base]) && #valid[~q~1!base]) && ~q~1!offset + 152 <= #length[~q~1!base])) || (((~p~1!offset + 244 <= ~q~1!offset && ~q~1!offset + 156 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 152 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~p~1!offset + 188 <= ~q~1!offset && ~q~1!offset + 212 <= #length[~q~1!base]) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 208 <= #length[#ptr!base])) || (((~q~1!offset + 288 <= #length[~q~1!base] && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 284 <= #length[#ptr!base]) && ~p~1!offset + 112 <= ~q~1!offset)) || (((~p~1!offset + 252 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 144 <= #length[#ptr!base]) && ~q~1!offset + 148 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((~p~1!offset + 72 <= ~q~1!offset && #valid[~q~1!base]) && ~q~1!offset + 328 <= #length[~q~1!base]) && #sizeOfReadType + #ptr!offset + 324 <= #length[#ptr!base])) || (((#valid[~q~1!base] && ~p~1!offset <= 0) && ~p~1!offset == ~q~1!offset) && 400 == #length[~q~1!base])) || (((~p~1!offset + 236 <= ~q~1!offset && ~q~1!offset + 164 <= #length[~q~1!base]) && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 160 <= #length[#ptr!base])) || (((~p~1!offset + 212 <= ~q~1!offset && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 184 <= #length[#ptr!base]) && ~q~1!offset + 188 <= #length[~q~1!base])) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 72 <= #length[#ptr!base]) && ~p~1!offset + 324 <= ~q~1!offset) && ~q~1!offset + 76 <= #length[~q~1!base])) || (((#valid[~q~1!base] && #sizeOfReadType + #ptr!offset + 48 <= #length[#ptr!base]) && ~p~1!offset + 348 <= ~q~1!offset) && ~q~1!offset + 52 <= #length[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 168 <= #length[#ptr!base] && #valid[~q~1!base]) && ~q~1!offset + 172 <= #length[~q~1!base]) && ~p~1!offset + 228 <= ~q~1!offset)) || (((~q~1!offset + 192 <= #length[~q~1!base] && ~p~1!offset + 208 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 188 <= #length[#ptr!base]) && #valid[~q~1!base])) || (((~p~1!offset + 60 <= ~q~1!offset && #sizeOfReadType + #ptr!offset + 336 <= #length[#ptr!base]) && ~q~1!offset + 340 <= #length[~q~1!base]) && #valid[~q~1!base])) || (((#sizeOfReadType + #ptr!offset + 224 <= #length[#ptr!base] && ~p~1!offset + 172 <= ~q~1!offset) && #valid[~q~1!base]) && ~q~1!offset + 228 <= #length[~q~1!base])) || (((~p~1!offset + 384 <= ~q~1!offset && #valid[~q~1!base]) && #sizeOfReadType + #ptr!offset + 12 <= #length[#ptr!base]) && ~q~1!offset + 16 <= #length[~q~1!base])) || (((#valid[~q~1!base] && ~q~1!offset + 184 <= #length[~q~1!base]) && ~p~1!offset + 216 <= ~q~1!offset) && #sizeOfReadType + #ptr!offset + 180 <= #length[#ptr!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 2 error locations. SAFE Result, 210.8s OverallTime, 103 OverallIterations, 101 TraceHistogramMax, 79.4s AutomataDifference, 0.0s DeadEndRemovalTime, 58.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 422 SDtfs, 20918 SDslu, 1152 SDs, 0 SdLazy, 32344 SolverSat, 10317 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10507 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186743 ImplicationChecksByTransitivity, 53.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=506occurred in iteration=102, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 27.3s AutomataMinimizationTime, 103 MinimizatonAttempts, 303 StatesRemovedByMinimization, 101 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 517 NumberOfFragments, 12616 HoareAnnotationTreeSize, 10 FomulaSimplifications, -4378 FormulaSimplificationTreeSizeReduction, 40.5s HoareSimplificationTime, 10 FomulaSimplificationsInter, 195173 FormulaSimplificationTreeSizeReductionInter, 18.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 5.4s SatisfiabilityAnalysisTime, 27.0s InterpolantComputationTime, 25767 NumberOfCodeBlocks, 25767 NumberOfCodeBlocksAsserted, 103 NumberOfCheckSat, 25664 ConstructedInterpolants, 0 QuantifiedInterpolants, 61148041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 103 InterpolantComputations, 3 PerfectInterpolantSequences, 24556/853452 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-38-31-626.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/PointerIncrement.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-38-31-626.csv Received shutdown request...